// UUID: 50eae61e-f826-4989-b2e9-0415c9b99392
#include <bits/stdc++.h>
using namespace std;

int main() {
	long long n , h;
	cin >> n >> h;
	vector < array < long long , 3 > >kv;
	for(int i = 0; i < n; i++){
		long long k , v; 
		cin >> k >> v; 
		kv.push_back({v , k , i + 1});
	}
	sort(kv.begin() , kv.end()); 
	long long d = 0; 
	vector < long long > m1; 
	vector < long long > m2; 
	long long veg1 = 0; 
	long long veg2 = 0; 
	for(auto[v , k , i] : kv){
		//cout << v << " " << k << " " << i << endl; 
		if(veg1 < k && veg2 >= k){
			//d = 0; 
			veg1 = v; 
			//d++; 
			m1.push_back(i); 
		}else if(veg2 < k && veg1 >= k){
			//d++; 
			veg2 = v; 
			m2.push_back(i); 
		}else if(veg1 < k && veg2 < k && veg1 >= veg2){
			veg1 = v; 
			m1.push_back(i); 
		}else if(veg1 < k && veg2 < k && veg1 <= veg2){
			veg2 = v; 
			m2.push_back(i); 
		}
	}
	cout << m2.size() << " " << m1.size() << endl; 
	for(int i : m2){
		cout << i << " ";
	}
	cout << endl;
	for(int i : m1){
		cout << i << " ";
	}

}