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

int n,h;
queue<int> a,b;
int kezda=0,kezdb=0;
ifstream fin("be.txt");

struct elem
{
    int k,v,sor;
};

elem tmb[100001];

bool has(elem x,elem y)
{
    if(x.v==y.v)
    {
        return x.k>y.k;
    }
    return x.v<y.v;
}

int main()
{
    cin>>n;
    cin>>h;
    int x,y;
    elem uj;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        uj.k=x;
        uj.v=y;
        uj.sor=i;
        tmb[i]=uj;
    }
    //cout<<"--------------------";
    sort(tmb+1,tmb+n,has);
    for(int i=1;i<=n;i++)
    {
        if(kezda>=kezdb)
        {
            if(tmb[i].k>kezda)
            {
                a.push(tmb[i].sor);
                kezda=tmb[i].v;
            // cout<<tmb[i].v<<" ";
            }
            else if(tmb[i].k>kezdb)
            {
                b.push(tmb[i].sor);
                kezdb=tmb[i].v;
            }
        }
        else
        {
            if(tmb[i].k>kezdb)
            {
                b.push(tmb[i].sor);
                kezdb=tmb[i].v;
            // cout<<tmb[i].v<<" ";
            }
            else if(tmb[i].k>kezda)
            {
                a.push(tmb[i].sor);
                kezda=tmb[i].v;
            }
        }
    }
        cout<<a.size()<<" "<<b.size()<<endl;
        while(!a.empty())
        {
            cout<<a.front()<<" ";
            a.pop();
        }
        cout<<endl;
        while(!b.empty())
        {
            cout<<b.front()<<" ";
            b.pop();
        }
    
    return 0;
}