// UUID: 2a96a59d-06e2-4cdc-8fde-916ac77739c0
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, H;
	cin >> N >> H;

	vector<array<int, 3>> rendelesek(N);

	for (int i = 0; i < N; ++i) {
        int k, v;
        cin >> k >> v;
        rendelesek[i] = {v, k, i + 1};
    }

	sort(rendelesek.begin(), rendelesek.end());

    int mveg = 0, fveg = 0;
    vector<int> mrendelesek, frendelesek;

    for (int i = 0; i < N; i++) {
        if (rendelesek[i][1] > min(mveg, fveg)) {
            if (mveg <= fveg) {
                // Mester szabadul előbb
                mrendelesek.push_back(rendelesek[i][2]);
                mveg = rendelesek[i][0];
            } else {
                // Fia szabadul előbb
                frendelesek.push_back(rendelesek[i][2]);
                fveg = rendelesek[i][0];
            }
        }
    }

    cout << mrendelesek.size() << " " << frendelesek.size() << "\n";
    for (int i = 0; i < mrendelesek.size(); i++) {
        cout << mrendelesek[i] << " ";
    }
    cout << "\n";
    for (int i = 0; i < frendelesek.size(); i++) {
        cout << frendelesek[i] << " ";
    }
}