#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n, h;
    cin >> n >> h;
    vector<pair<pair<int, int>, int>> v(n);
    for (int i = 0; i < n; i++) {
        int e, m;
        cin >> e >> m;
        v[i].first.first = m;
        v[i].first.second = e;
        v[i].second = i+1;
    }
    sort(v.begin(), v.end());
    vector<int> mekk;
    vector<int> fia;
    int ja = 0;
    int jf = 0;
    int cv = 0;
    while (cv<n) {
        if (ja > jf) {
            if (v[cv].first.second > ja) {
                mekk.push_back(v[cv].second);
                ja = v[cv].first.first;
            }
            else if (v[cv].first.second > jf) {
                fia.push_back(v[cv].second);
                jf = v[cv].first.first;
            }
            cv++;
        }
        else {
            if (v[cv].first.second > jf) {
                mekk.push_back(v[cv].second);
                ja = v[cv].first.first;
            }
            else if (v[cv].first.second > ja) {
                fia.push_back(v[cv].second);
                jf = v[cv].first.first;
            }
            cv++;
        }
    }    
    cout << mekk.size() << " " << fia.size() << endl;
    for (int x : mekk) cout << x << " ";
    cout << endl;
    for (int x : fia) cout << x << " ";
}