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

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

int h(munka x, munka y) {
    return x.vn < y.vn;  // cleaner comparison
}

int main() {
    int n, H;
    cin >> n >> H;
    
    int s1[H + 1] = {0}; // Availability array 1
    int s2[H + 1] = {0}; // Availability array 2
    int jok1 = 0, jok2 = 0;
    
    int jokt1[n] = {0};  // Jobs for schedule 1
    int jokt2[n] = {0};  // Jobs for schedule 2
    
    int a = 0, b = 0;    // Track index for jokt1, jokt2
    munka t[n];
    
    for (int i = 0; i < n; i++) {
        cin >> t[i].kn >> t[i].vn;
        t[i].sz = i + 1; // job index
    }

    sort(t, t + n, h);  // Sorting by vn

    for (int i = 0; i < n; i++) {
        int lehet1 = 1;
        for (int j = t[i].kn; j <= t[i].vn; j++) {
            if (s1[j] == 1) {
                lehet1 = 0;
                break;
            }
        }
        if (lehet1) {
            for (int j = t[i].kn; j <= t[i].vn; j++) {
                s1[j] = 1;
            }
            jok1++;
            jokt1[a++] = t[i].sz;
        } else {
            int lehet2 = 1;
            for (int j = t[i].kn; j <= t[i].vn; j++) {
                if (s2[j] == 1) {
                    lehet2 = 0;
                    break;
                }
            }
            if (lehet2) {
                for (int j = t[i].kn; j <= t[i].vn; j++) {
                    s2[j] = 1;
                }
                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;
}