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

struct munka
{
int k,v,i;
}typedef munka;

int main()
{
    int n,m;
    cin>>n>>m;
    vector<munka> munkak(n);
    int i=1;
    for(auto &x:munkak){cin>>x.k>>x.v;x.i=i;i++;}
    sort(munkak.begin(),munkak.end(),[](munka a,munka b)
         {
         if(a.v<b.v)return true;
         if(a.v>b.v)return false;
         return a.k>b.k;
         });
    int mesterl=-1;
    int fial=-1;
    vector<int> mester,fia;
    for(i=0;i<n;i++)
        {
        if(mesterl<munkak[i].k && fial<munkak[i].k)
            {
            if(fial>mesterl)
                {
                fia.push_back(munkak[i].i);
                fial=munkak[i].v;
                }
            else
                {
                mester.push_back(munkak[i].i);
                mesterl=munkak[i].v;
                }
            }
        else if(mesterl<munkak[i].k)
            {
            mester.push_back(munkak[i].i);
            mesterl=munkak[i].v;
            }
        else if(fial<munkak[i].k)
            {
            fia.push_back(munkak[i].i);
            fial=munkak[i].v;
            }
        }
    cout<<mester.size()<<" "<<fia.size()<<"\n";
    for(int i: mester)cout<<i<<" ";
    cout<<"\n";
    for(int i: fia)cout<<i<<" ";
    return 0;
}