#include <bits/stdc++.h>
using namespace std;


int main()
{
    int n, m;
    cin >> n >> m;
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>>pq;
    for (int i = 1; i <= n; i++) {
        int u, v;
        cin >> u >> v;
        pq.push({v, u, i});
    }
    vector<int> v1, v2;
    int m1 = 0, m2 = 0;

    while (!pq.empty()) {
        int finish = get<0>(pq.top());
        int start = get<1>(pq.top());
        int id = get<2>(pq.top());
        pq.pop();

        if (m1 > m2) {
            if (m1 <= start) {
                m1 = finish + 1;
                v1.push_back(id);
            } else if (m2 <= start) {
                m2 = finish + 1;
                v2.push_back(id);
            }
        } else {
            if (m2 <= start) {
                m2 = finish + 1;
                v2.push_back(id);
            } else if (m1 <= start) {
                m1 = finish + 1;
                v1.push_back(id);
            }
        }
    }

    cout << v1.size() << ' ' << v2.size() << '\n';
    for (int x : v1) {
        cout << x << ' ';
    }
    cout << '\n';
    for (int x : v2) {
        cout << x << ' ';
    }
    cout << '\n';

    return 0;
}