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

struct munka
{
    int kezd, veg, index;
};

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

int main()
{
    int n, h;
    cin >> n >> h;

    vector <munka> m(n);
    for (int i = 0; i < n; i++)
    {
        cin >> m[i].kezd >> m[i].veg;
        m[i].index = i + 1;
    }

    sort(m.begin(), m.end(), hasonlit);

    vector<int> apa, fiu;
    int vege_apa = 0, vege_fiu = 0;
    for (int i=0; i<n; i++)
    {
        if (m[i].kezd > vege_apa)
        {
            apa.push_back(m[i].index);
            vege_apa = m[i].veg;
        }
        else
            if (m[i].kezd > vege_fiu)
        {
            fiu.push_back(m[i].index);
            vege_fiu = m[i].veg;
        }
    }

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