#include <bits/stdc++.h>

using namespace std;
struct bencu{
    int e;
    int v;
    int sz;
}a[100001];
bool cucc(bencu b,bencu c){
    return b.v<c.v;
}
int n,h,ut1,ut2,s1,s2,b[100001],c[100001];

int main()
{
    ifstream f("be.in");
    f>>n;
    f>>h;
    for(int i=1;i<=n;i++){
        f>>a[i].e;
        f>>a[i].v;
        a[i].sz=i;
    }
    sort(a+1,a+n+1,cucc);
    for(int i=1;i<=n;i++){
        if(ut1<=ut2){
            if(ut2<a[i].e){
                s2++;
                c[s2]=a[i].sz;
                ut2=a[i].v;
            }
            else if(ut1<a[i].e){
                s1++;
                b[s1]=a[i].sz;
                ut1=a[i].v;
            }
        }
        else{
            if(ut1<a[i].e){
                s1++;
                b[s1]=a[i].sz;
                ut1=a[i].v;
            }
            else if(ut2<a[i].e){
                s2++;
                c[s2]=a[i].sz;
                ut2=a[i].v;
            }
        }
    }
    cout<<s1<<" "<<s2<<endl;
    for(int i=1;i<=s1;i++){
        cout<<b[i]<<" ";
    }cout<<endl;
    for(int i=1;i<=s2;i++){
        cout<<c[i]<<" ";
    }
    return 0;
}