// UUID: 84d15bad-088e-411b-8e6c-eeebce521dd4
#include <bits/stdc++.h>
using namespace std;

struct Job {
    int k, v, id;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, H;
    cin >> N >> H;
    vector<Job> jobs(N);
    for (int i=0;i<N;i++) {
        cin >> jobs[i].k >> jobs[i].v;
        jobs[i].id = i+1;
    }

    sort(jobs.begin(), jobs.end(), [](auto &a, auto &b){
        if (a.v == b.v) return a.k < b.k;
        return a.v < b.v;
    });

    int end1 = 0, end2 = 0;
    vector<int> mester, fiu;

    for (auto &job : jobs) {
        int s = job.k, e = job.v, id = job.id;
        if (s > end1 && s > end2) {
            // mindkettőhöz jó, annak adjuk aki később végzett
            if (end1 > end2) {
                mester.push_back(id);
                end1 = e;
            } else {
                fiu.push_back(id);
                end2 = e;
            }
        } else if (s > end1) {
            mester.push_back(id);
            end1 = e;
        } else if (s > end2) {
            fiu.push_back(id);
            end2 = e;
        }
    }

    cout << mester.size() << " " << fiu.size() << "\n";
    for (int x : mester) cout << x << " ";
    cout << "\n";
    for (int x : fiu) cout << x << " ";
    cout << "\n";
}