#include <bits/stdc++.h>

using namespace std;

int N, H;
vector<int> K(N);
vector<int> V(N);

bool sortf(vector<int> a, vector<int> b){
    return a[2] < b[2];
}

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

    vector<vector<int>> w;
    for(int i=0; i<N; i++){
        vector<int> t(3);
        t[0] = i;
        cin >> t[1] >> t[2];

        w.push_back(t);
    }

    sort(w.begin(), w.end(), sortf);

    vector<int> M1, M2;

    int v1 = 0, v2 = 0;
    for(vector<int> i : w){
        if(i[1] > v1){
            M1.push_back(i[0]);
            v1 = i[2];
        }else if(i[1] > v2){
            M2.push_back(i[0]);
            v2 = i[2];
        }
    }

    cout << M1.size() << " " << M2.size() << endl;

    for(int i : M1) cout << i + 1 << " ";
    cout << endl;
    for(int i : M2) cout << i + 1<< " ";

    return 0;
}