#include <iostream>
#include <algorithm>
using namespace std;

int N, M;

struct Munka {
    int a, b, id;
};

Munka m[100000];

int id_A[100000];
int id_B[100000];
int dbA = 0, dbB = 0;

int main()
{
    cin >> N >> M;

    for(int i = 0; i < N; i++){
        cin >> m[i].a >> m[i].b;
        m[i].id = i + 1;
    }

    // végidő szerint rendezünk
    sort(m, m + N, [](Munka x, Munka y){
        return x.b < y.b;
    });

    int vegeA = 0, vegeB = 0;

    for(int i = 0; i < N; i++){
        int a = m[i].a;
        int b = m[i].b;

        // mindig az legyen A, aki előbb felszabadul
        if(vegeA > vegeB){
            swap(vegeA, vegeB);
            swap(dbA, dbB);
        }

        if(a >= vegeA){
            id_A[dbA++] = m[i].id;
            vegeA = b;
        }
        else if(a >= vegeB){
            id_B[dbB++] = m[i].id;
            vegeB = b;
        }
    }

    cout << dbA << " " << dbB << "\n";

    for(int i = 0; i < dbA; i++){
        cout << id_A[i] << " ";
    }
    cout << "\n";

    for(int i = 0; i < dbB; i++){
        cout << id_B[i] << " ";
    }

    return 0;
}