// UUID: b4163720-b3d3-4f78-8b0d-9c9ec9516576
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, H; cin>>N>>H;
	vector<array<int, 3>> V(N);//0.: v
	for(int i=0; i<N; i++) {cin>>V[i][1]>>V[i][0]; V[i][2]=i+1;}
	sort(V.begin(), V.end());
	vector<int> sorszam1(0);
	vector<int> sorszam2(0);
	int ido1=1, ido2=1;
	for(int i=0; i<N; i++)
	{
		if(V[i][1]>=ido1 and V[i][1]<ido2)
		{
			sorszam1.push_back(V[i][2]);
			ido1=V[i][0]+1;
		}
		else if(V[i][1]>=ido2 and V[i][1]<ido1)
		{
			sorszam2.push_back(V[i][2]);
			ido2=V[i][0]+1;
		}
		else if(V[i][1]>=ido1 and V[i][1]>=ido2)
		{
			if(ido1>ido2)
			{
				sorszam1.push_back(V[i][2]);
			ido1=V[i][0]+1;
			}
			else
			{
				sorszam2.push_back(V[i][2]);
			ido2=V[i][0]+1;
			}
		}
	}
	
	cout<<sorszam1.size()<<" "<<sorszam2.size()<<'\n';
	for(int i=0; i<sorszam1.size(); i++) cout<<sorszam1[i]<<" ";
	cout<<'\n';
	for(int i=0; i<sorszam2.size(); i++) cout<<sorszam2[i]<<" ";
}