// UUID: a16d0560-8f35-4bc4-bee8-a80138d37fec
#include <bits/stdc++.h>
using namespace std;

struct rendel
{
	int kezd;
	int veg;
	int index;
};

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

	vector <rendel>  orders(n+1);
	orders[0].veg=0;
	for (int i=1; i<=n; i++) {
		cin >> orders[i].kezd >> orders[i].veg;
		orders[i].index=i;
	}

	sort (orders.begin(), orders.end(), [] (const rendel& a, const rendel& b){
		return a.veg<b.veg;		
	});

	vector <int> mester; vector <int> fia;
	mester.push_back(0); fia.push_back(0);
	int mester_u=0, fia_u=0;

	for (int i=1; i<=n; i++) {



		if (orders[i].kezd>orders[mester_u].veg) {
			mester.push_back(orders[i].index);
			mester_u=i;
		}
		else if (orders[i].kezd>orders[fia_u].veg) {
			fia.push_back(orders[i].index);
			fia_u=i;		
		}
	}

	cout << mester.size()-1 << " " << fia.size()-1 << "\n";
	sort(mester.begin(), mester.end());
	sort(fia.begin(), fia.end());
	for (int i=1; i<mester.size(); i++) {
		cout << mester[i] << " ";
	}
	cout << "\n";
	for (int i=1; i<fia.size(); i++) {
		cout << fia[i] << " ";
	}
	cout << "\n";
	/*for (int i=1; i<=n; i++) {
		cout << orders[i].kezd << " " << orders[i].veg << " " << orders[i].index << "\n";
	}*/
}