#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

struct Work
{
    int s, e, idx;
};

static bool Compare(Work a, Work b)
{
    return a.e < b.e;
}

int main()
{
    int n, k;
    cin >> n >> k;

    vector <Work> workList(n);

    for (int i = 0; i < n; i++)
    {
        cin >> workList[i].s >> workList[i].e;
        workList[i].idx = i;
    }

    sort(workList.begin(), workList.end(), Compare);

    vector<int> aAns;
    vector<int> bAns;

    int aEnd = 0;
    int bEnd = 0;

    bool aAnsCurrent;
    bool bAnsCurrent;

    int aCount = 0;
    int bCount = 0;

    for (int i = 0; i < n; i++)
    {
        aAnsCurrent = (workList[i].s > aEnd);
        bAnsCurrent = (workList[i].s > bEnd);
        if (aAnsCurrent && bAnsCurrent)
        {
            if (aEnd > bEnd)
            {
                aAns.push_back(workList[i].idx + 1);
                aCount++;
                aEnd = workList[i].e;
            }
            else
            {
                bAns.push_back(workList[i].idx + 1);
                bCount++;
                bEnd = workList[i].e;
            }
        }
        else
        {
            if (aAnsCurrent)
            {
                aAns.push_back(workList[i].idx + 1);
                aCount++;
                aEnd = workList[i].e;
            }
            else
            {
                if (bAnsCurrent)
                {
                    bAns.push_back(workList[i].idx + 1);
                    bCount++;
                    bEnd = workList[i].e;
                }
            }
        }
    }

    cout << aCount << " " << bCount << endl;

    for (int x : aAns)
    {
        cout << x << " ";
    }
    cout << endl;

    for (int x : bAns)
    {
        cout << x << " ";
    }
    cout << endl;
    return 0;
}