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

using namespace std;

struct job
{
    int k, v, index;
};

bool compare(const job &a, const job &b)
{
    return a.v < b.v;
}

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

    vector<job> v(n);

    for(int i = 0; i < n; i++)
    {
        cin >> v[i].k >> v[i].v;
        v[i].index = i + 1;
    }

    sort(v.begin(), v.end(), compare);

    vector<int> dad;
    vector<int> boy;

    int lastdad = 0;
    int lastboy = 0;

    for(job j : v)
    {
        if(j.k > lastdad && j.k > lastboy)
        {
            if(lastdad > lastboy)
            {
                dad.push_back(j.index);
                lastdad = j.v;
            }else
            {
                boy.push_back(j.index);
                lastboy = j.v;
            }
        }else
        {
            if(j.k > lastdad)
            {
                dad.push_back(j.index);
                lastdad = j.v;
            }else if(j.k > lastboy)
            {
                boy.push_back(j.index);
                lastboy = j.v;
            }
        }
    }

    cout << (int)dad.size() << " " << (int)boy.size() << "\n";

    for(int d : dad)
    {
        cout << d << " ";
    }

    cout << "\n";

    for(int b : boy)
    {
        cout << b << " ";
    }

    return 0;
}