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


int main(){
    int n,h; cin>>n>>h;
    vector<array<long long, 3>> munka;
    for (int i=0;i<n;++i){
        int k,v;cin>>k>>v;
        munka.push_back({k,v,i});
    }
    sort(munka.begin(), munka.end());
    int db=0;
    vector <long long> x1,x2;
    long long veg1=0, veg2=0;
    for (auto[v,k,i]:munka){
        if (veg1<k && veg2>=k){
            veg1=v;
            x1.push_back(i);
        }
        else if (veg2<k && veg1>=k){
            veg2=v;
            x2.push_back(i);
        }
        else if(veg1<k && veg2<k && veg1>=veg2){
            veg1=v; x1.push_back(i);
        }
        else if (veg1<k && veg2<k && veg1<=veg2){
            veg2=v;
            x2.push_back(i);
        }
    }
    cout<<x2.size()<<" "<<x1.size()<<"\n";
    for (int i:x2){
        cout<<i<<" ";
    }
    cout<<"\n";
    for (int i:x1){
        cout<<i<<" ";
    }
}