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

using namespace std;

struct Munka {
    int k;
    int v;
    int index;
};

int n, h;
vector<Munka> munkak;
vector<Munka> mesterMunkak;
vector<Munka> fiuMunkak;

bool Compare1(const Munka& a, const Munka& b) {
    return a.v < b.v;
}

void Beolvas() {
    cin >> n >> h;
    munkak.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> munkak[i].k >> munkak[i].v;
        munkak[i].index = i;
    }
}

void Kiir() {
    cout << mesterMunkak.size() << ' ' << fiuMunkak.size() << '\n';
    for (auto x : mesterMunkak) {
        cout << x.index << ' ';
    }
    cout << '\n';
    for (auto x : fiuMunkak) {
        cout << x.index << ' ';
    }
}

void Feladat() {
    int mesterFoglalt = 0;
    int fiuFoglalt = 0;
    for (int i = 1; i <= n; i++) {
        if (mesterFoglalt > fiuFoglalt) {
            if (mesterFoglalt < munkak[i].k) {
                mesterMunkak.push_back(munkak[i]);
                mesterFoglalt = munkak[i].v;
            }
            else if (fiuFoglalt < munkak[i].k) {
                fiuMunkak.push_back(munkak[i]);
                fiuFoglalt = munkak[i].v;
            }
        }
        else {
            if (fiuFoglalt < munkak[i].k) {
                fiuMunkak.push_back(munkak[i]);
                fiuFoglalt = munkak[i].v;
            }
            else if (mesterFoglalt < munkak[i].k) {
                mesterMunkak.push_back(munkak[i]);
                mesterFoglalt = munkak[i].v;
            }
        }
    }
}

int main() {
    Beolvas();
    sort(munkak.begin(), munkak.end(), Compare1);
    Feladat();
    Kiir();
    return 0;
}