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

using namespace std;

struct munka
{
    int k,v,ind;
};

bool hasonlit (munka a, munka b)
{
    return a.v<b.v;
}

int main()
{
    int n ,p;
    cin >> n >> p;
    vector <munka> m(n);
    for (int i=0; i<n; i++)
    {
        cin >> m[i].k >> m[i].v;
        m[i].ind=i+1;
    }
    sort(m.begin(),m.end(),hasonlit);

    vector <int> apa, fiu;
    int vegea=0, vegef=0;
    bool a,f;
    for (int i=0; i<n; i++)
    {
        a=(m[i].k>vegea);
        f=(m[i].k>vegef);
        if (a && f)
        {
            if (vegea>vegef)
            {
                apa.push_back(m[i].ind);
                vegea=m[i].v;
            }
            else
            {
                fiu.push_back(m[i].ind);
                vegef=m[i].v;
            }
        }
        else
        {
            if (a)
            {
                apa.push_back(m[i].ind);
                vegea=m[i].v;
            }
            else
            {
                if (f)
                {
                    fiu.push_back(m[i].ind);
                    vegef=m[i].v;
                }
            }
        }
    }

    cout << apa.size() << " " << fiu.size() << endl;
    for (int x : apa)
    {
        cout << x << " ";
    }
    cout << endl;
    for (int x:fiu)
    {
        cout << x << " ";
    }
    return 0;
}