#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct munka
{
    int a;
    int b;
    int sor;
};

int n,h;
vector<munka>munkak;
vector<munka>mester;
vector<munka>fiu;

bool comp(const munka &a, const munka &b){
    return a.b < b.b;
}

void be()
{
    cin>>n>>h;
    munkak.resize(n+1);
    for(int i=1;i<=n;i++)
    {
        cin>>munkak[i].a>>munkak[i].b;
        munkak[i].sor=i;
    }
    sort(munkak.begin(), munkak.end(), comp);
}
void feladat2()
{
    mester.push_back(munkak[1]);
    fiu.push_back(munkak[2]);
    for(int i=3;i<=n;i++)
    {
        if(mester.back().b>fiu.back().b)
        {
                if(munkak[i].a>mester.back().b)mester.push_back(munkak[i]);
                else if(munkak[i].a>fiu.back().b)fiu.push_back(munkak[i]);
        }
        else
        {
                if(munkak[i].a>fiu.back().b)fiu.push_back(munkak[i]);
                else if(munkak[i].a>mester.back().b)mester.push_back(munkak[i]);
        }

    }
}

int main()
{
    be();
    feladat2();
    cout<<mester.size()<<" "<<fiu.size();
    cout<<endl;
    for(int i=0;i<mester.size();i++)
    {
        cout<<mester[i].sor<<" ";
    }
    cout<<endl;
    for(int i=0;i<fiu.size();i++)
    {
        cout<<fiu[i].sor<<" ";
    }

    return 0;
}