#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct vekkVester {
    int x;
    int y;
    int index;
};
bool cmp(vekkVester a, vekkVester b) {
    return a.y < b.y;
}
vector <vekkVester> veki, boyt, mastert;
int n, napok;
void be() {
    cin >> n>>napok;
    veki.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> veki[i].x >> veki[i].y;
        veki[i].index = i;
    }
    sort(veki.begin(), veki.end(), cmp);
}
void ki() {
    cout << endl << endl;
    for (int i = 1; i <= n; i++) {
        cout << veki[i].x << ' ' << veki[i].y << endl;
    }
}
void boy(vekkVester nap) {
    boyt.push_back(nap);
}
void master(vekkVester nap) {
    mastert.push_back(nap);
}
void fBig(int i=1, bool akt=1) {
    if (i <= n) {
        if (i == 1) {
            master(veki[i]);
            fBig(i+1, 1);
        }
        else {
            if (akt) {
                if (veki[i].x>mastert.back().y) {
                    master(veki[i]);
                    fBig(i + 1, 1);
                }
                else {
                    if (boyt.empty()||veki[i].x > boyt.back().y) {
                        boy(veki[i]);
                        fBig(i + 1, 0);
                    }
                    else {
                        fBig(i+1, 1);
                    }
                }
            }
            else {
                if (veki[i].x > boyt.back().y) {
                    boy(veki[i]);
                    fBig(i + 1, 0);
                }
                else {
                    if (veki[i].x > mastert.back().y) {
                        master(veki[i]);
                        fBig(i + 1, 1);
                    }
                    else {
                        fBig(i + 1, 0);
                    }
                }
            }
        }
    }
}


int main()
{
    be();
    //ki();
    fBig();
    cout << boyt.size() << ' '<< mastert.size()<<endl;
    for (int i = 0; i < boyt.size(); i++) {
        cout << boyt[i].index << ' ';
    }
    cout << endl;
    for (int i = 0; i < mastert.size(); i++) {
        cout << mastert[i].index << ' ';
    }

}