#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<pair<pair<int, int>, int>> f=v;
    vector<int> mekk;
    vector<int> fia;
    int j = v[0].first.first;
    f.erase(f.begin());
    mekk.push_back(v[0].second);
    v.erase(v.begin());
    int cv = 0;
    while (cv<n-1) {
        if (v[cv].first.second > j) {
            mekk.push_back(v[cv].second);
            j = v[cv].first.first;
            f.erase(f.begin() + cv-(v.size()-f.size()));
        }
        cv++;
    }    
    fia.push_back(f[0].second);
    j = f[0].first.first;
    cv = 1;
    while (cv < f.size()) {
        if (f[cv].first.second > j) {
            fia.push_back(f[cv].second);
            j = f[cv].first.first;
        }
        cv++;
    }
    sort(fia.begin(), fia.end());
    sort(mekk.begin(), mekk.end());
    cout << mekk.size() << " " << fia.size() << endl;
    for (int x : mekk) cout << x << " ";
    cout << endl;
    for (int x : fia) cout << x << " ";
}