// UUID: 27ad6c82-3e14-4281-be27-088f9aaba49e
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
using namespace std;

int main() {
    int n, h, k, v, a = 0, b = 0;
    cin >> n >> h;

    vector<array<int, 3>> tasks;

    for (int i = 0; i < n; ++i) {
        cin >> k >> v;
        tasks.push_back({ v, k, i + 1 });
    }

    sort(tasks.begin(), tasks.end());
    vector<int> mester, fia;
    
    for (int i = 0; i < n; ++i) {
        if (tasks[i][1] > a) {
            mester.push_back(tasks[i][2]);
            a = tasks[i][0];
        } else if (tasks[i][1] > b) {
            fia.push_back(tasks[i][2]);
            b = tasks[i][0];
        }
    }

    
	cout << mester.size() << ' ' << fia.size() << endl;
    for (int i = 0; i < mester.size(); ++i) {
        cout << mester[i] << ' ';
    }
    cout << endl;
    for (int i = 0; i < fia.size(); ++i) {
        cout << fia[i] << ' ';
    }
}