#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

struct comp{
    bool operator()(pii a, pii b){
        return a.second - a.first < b.second - b.first;
    }
};

vector<pii> alap;

struct comp1{
    bool operator()(int a, int b){
        return alap[a].first < alap[b].first;
    }
};

struct comp2{
    bool operator()(int a, int b){
        return alap[a].second - alap[a].first < alap[b].second - alap[b].first;
    }
};

int main()
{
    int n, m;
    cin >> n >> m;

    alap.assign(n, {0, 0});
    vector<int> ind(n);
    iota(ind.begin(), ind.end(), 0);
    for(int i = 0; i < n; i++){
        cin >> alap[i].first >> alap[i].second;
    }

    sort(ind.begin(), ind.end(), comp2());
    sort(alap.begin(), alap.end(), comp());

    vector<int> egy, ket;
    for(int i = 0; i < n; i++){
        bool jo = 1;
        for(int x : egy){
            if(!(alap[i].second < alap[x].first || alap[x].second < alap[i].first)){
                jo = 0;
                break;
            }
        }

        if(jo){
            egy.push_back(i);
            continue;
        }

        jo = 1;
        for(int x : ket){
            if(!(alap[i].second < alap[x].first || alap[x].second < alap[i].first)){
                jo = 0;
                break;
            }
        }

        if(jo){
            ket.push_back(i);
        }
    }

    sort(egy.begin(), egy.end(), comp1());
    sort(ket.begin(), ket.end(), comp1());

    cout << egy.size() << " " << ket.size() << "\n";
    for(int x : egy) cout << ind[x] + 1 << " ";
    cout << "\n";
    for(int x : ket) cout << ind[x] + 1 << " ";
    cout << "\n";
}