// UUID: 95585578-864f-4865-9d2f-45723df7c589
#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);
	vector <rendel> og(n+1);
	orders[0].veg=0;
	for (int i=1; i<=n; i++) {
		cin >> orders[i].kezd >> orders[i].veg;
		orders[i].index=i;
	}

	og=orders;

	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++) {
		bool mester_s=orders[i].kezd>orders[mester_u].veg; 
		bool fia_s=orders[i].kezd>orders[fia_u].veg;

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

			if (mester_s==1) {
				mester.push_back(orders[i].index);
				//cout << orders[i].kezd << " " << orders[mester_u].veg << "\n";
				mester_u=i;
			}
			else if (fia_s==1) {
				fia.push_back(orders[i].index);
				fia_u=i;		
			}
		}
	}

	cout << mester.size()-1 << " " << fia.size()-1 << "\n";
	sort(mester.begin()+1, mester.end(), [&] (const int& a, const int& b) {
		return og[a].kezd<og[b].kezd;
	});

	sort(fia.begin()+1, fia.end(), [&] (const int& a, const int& b) {
		return og[a].kezd<og[b].kezd;
	});

	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";
}