#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>

using std::pair, std::vector;

bool feltetel(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) {
    if(a.second.second == b.second.second)
        return a.second.first > b.second.first;
    return a.second.second > b.second.second;
}

struct Dolgozo {
    vector<int> elvegzett;
    vector<bool> occupied;

    Dolgozo(int n, int h) {
        occupied.resize(h, 0);
    }
    bool free(pair<int, int> j) {
        for(int i = j.first; i <= j.second; i++)
            if(occupied[i])
                return 0;
        return 1;
    }
    void occ(pair<int, int> j) {
        for(int i = j.first; i <= j.second; i++)
            occupied[i] = 1;
    }
};

int main() {
    int n, h;
    std::cin >> n >> h; // n megrendelés, h napra
    vector<pair<int, pair<int, int>>> munkak;
    Dolgozo apa(n, h), fiu(n, h);
    for(int i = 0; i < n; i++) {
        int v, k;
        std::cin >> v >> k; v--; k--;
        munkak.push_back({i, {v, k}});
    }
    std::sort(munkak.begin(), munkak.end(), feltetel);
    
    for(int i = 0; i < n; i++) {
        pair<int, pair<int, int>> currJob = munkak[i];
        if (apa.free(currJob.second)) {
            apa.occ(currJob.second);
            apa.elvegzett.push_back(currJob.first);
        }
        else if(fiu.free(currJob.second)) {
            fiu.occ(currJob.second);
            fiu.elvegzett.push_back(currJob.first);
        }
    }


    std::cout << apa.elvegzett.size() << ' ' << fiu.elvegzett.size() << '\n';
    for(int i = apa.elvegzett.size() - 1; i >= 0; i--)
        std::cout << apa.elvegzett[i] << ' ';
    std::cout << '\n';
    for(int i = fiu.elvegzett.size() - 1; i >= 0; i--)
        std::cout << fiu.elvegzett[i] << ' ';
}