#include <bits/stdc++.h>

using namespace std;

typedef struct {
  int k, v , index;
   } Intervallum;
/*
10 14
2 4
1 7
7 12
10 12
3 9
4 5
6 6
8 10
10 13
3 7


*/

bool rendez(Intervallum i1, Intervallum i2)
{
    return i1.v<i2.v;
}


int main()
{
    int n, napok;
    cin>>n>>napok;
    vector <Intervallum> munka (n);
    Intervallum uj;
    for(int i=0;i<n;i++)
    {
        cin>>uj.k>>uj.v;
        uj.index=i+1;
        munka.at(i)=uj;
    }
   
    sort(munka.begin(),munka.end(),rendez);
    int mekkvege=0, fiavege=0;
    vector <int> mekk, fia;

    for (int i=0;i<n;i++)
    {
        Intervallum most=munka.at(i);
        if(most.k>mekkvege && most.k> fiavege)
        {
            if (mekkvege<fiavege)
            {
                mekk.push_back(most.index);
                mekkvege=most.v;
            }
            else
            {
                fia.push_back(most.index);
                fiavege=most.v;
            }
        }
        else if (mekkvege<most.k)
        {
                mekk.push_back(most.index);
                mekkvege=most.v;
        }
        else if (fiavege<most.k)
        {
                fia.push_back(most.index);
                fiavege=most.v;
        }
    }
    cout << mekk.size()<<" "<<fia.size() << endl;
    for (int x : mekk )
        cout<<x<<" ";
    cout<<endl;
    for (int x: fia)
        cout<<x<<" ";
    return 0;
}