#include <iostream>
#include <algorithm>

struct targy
{
    float nap1,nap2,k;
};
targy a[100];

bool hasonlit(targy a, targy b)
{
    return a.nap2 < b.nap2;
}


using namespace std;

int main()
{
    int o[100];
    int o2[100];
    int n,h,db=0,bd=0;
    cin >> n >> h;
    for (int i=0; i<n; i++)
    {
        cin >> a[i].nap1 >> a[i].nap2;
        a[i].k=i+1;
    }

    sort (a, a+n,hasonlit);

    int u = a[0].nap2;
    int u2;

    o[db] = a[0].k;
    db++;

    for (int i = 1; i < n; i++)
    {
        if (a[i].nap1 > u2)
        {
            o2[bd]=a[i].k;
            u2=a[i].nap2;
            bd++;
        }
        else if (a[i].nap1 > u)
        {o[db] = a[i].k;
            db++;
            u= a[i].nap2;

        }

    }
    cout << bd << " " << db << endl;

    for (int i = 0; i < bd; i++)
    {
        cout << o2[i] << " ";

    }
    cout << endl;
for (int i = 0; i < db; i++)
    {
        cout << o[i] << " ";
    }
    return 0;
}