// UUID: 6a47a125-0278-4166-83b6-21840ced5dfd
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, H;
    if (!(cin >> N >> H)) return 0;

    vector<tuple<int,int,int>> jobs; // (end, start, id)
    vector<int> start(N+1);
    for (int i = 1; i <= N; ++i) {
        int k, v; cin >> k >> v;
        jobs.emplace_back(v, k, i);
        start[i] = k;
    }

    sort(jobs.begin(), jobs.end()); // rendezés befejezés szerint

    const int K = 2;
    set<pair<int,int>> S; // (last_end, worker_id)
    int used = 0;
    vector<vector<int>> assigned(K);

    for (auto &t : jobs) {
        int e = get<0>(t), s = get<1>(t), id = get<2>(t);
        // keresés: legnagyobb end < s
        auto it = S.lower_bound({s, -1}); // első olyan, aminek end >= s
        if (it != S.begin()) {
            --it; // most it->first < s és ez a legnagyobb ilyen
            int wid = it->second;
            S.erase(it);
            S.insert({e, wid});
            assigned[wid].push_back(id);
        } else if ((int)S.size() < K) {
            int wid = used++;
            S.insert({e, wid});
            assigned[wid].push_back(id);
        } else {
            // nem fér el, kihagyjuk
        }
    }

    // időrendi (kezdési idő) sorrend a kimenethez
    for (int w = 0; w < K; ++w) {
        sort(assigned[w].begin(), assigned[w].end(),
             [&](int a, int b){ return start[a] < start[b]; });
    }

    cout << assigned[0].size() << " " << assigned[1].size() << "\n";
    for (int x : assigned[0]) cout << x << " ";
    cout << "\n";
    for (int x : assigned[1]) cout << x << " ";
    cout << "\n";

    return 0;
}