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

struct munka {
    int kn, vn, sz;
};

int h(munka x, munka y) {
    if (x.vn < y.vn)
        return true;
    else if (x.vn > y.vn)
        return false;
    else
        return x.kn > y.kn;
}

int jok1 = 0, jok2 = 0;

int jokt1[100001] = { 0 };
int jokt2[100001] = { 0 };

int a = 0, b = 0;
munka t[100001];

int main() {
    int n, H;
    cin >> n >> H;
    int veg1=0, veg2=0;
    for (int i = 0; i < n; i++) {
        cin >> t[i].kn >> t[i].vn;
        t[i].sz = i + 1; 
    }

    sort(t, t + n, h); 

    for (int i = 0; i < n; i++) {
        int lehet1 = t[i].kn > veg1;
        int lehet2 = t[i].kn > veg2;
        if (lehet1 and lehet2 == 0) {
            veg1 = t[i].vn;
            jok1++;
            jokt1[a++] = t[i].sz;
        }
        else if (lehet2 and lehet1 == 0) {
            veg2 = t[i].vn;
            jok2++;
            jokt2[b++] = t[i].sz;
        }
        else if (lehet1 and lehet2) {
            if (veg1 > veg2) {
                veg1 = t[i].vn;
                jok1++;
                jokt1[a++] = t[i].sz;
            }
            else {
                veg2 = t[i].vn;
                jok2++;
                jokt2[b++] = t[i].sz;
            }
        }
    }
    cout << jok1 << " " << jok2 << endl;

    for (int i = 0; i < jok1; i++) {
        cout << jokt1[i] << " ";
    }
    cout << endl;

    for (int i = 0; i < jok2; i++) {
        cout << jokt2[i] << " ";
    }
    cout << endl;

    return 0;
}