#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct job
{
	int start, end, number;
};

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

	vector<job> jobs(n);

	for (i = 0; i < n; i++)
	{
		jobs[i].number = i;
		cin >> jobs[i].start >> jobs[i].end;
	}

	int mlast = 0, flast = 0;
	vector<int> m, f;

	sort(jobs.begin(), jobs.end(), [](job a, job b) {
		if (a.end == b.end)
		{
			return a.start < b.start;
		}
		return a.end < b.end;
		});

	for (i = 0; i < n; i++)
	{
		int start = jobs[i].start, end = jobs[i].end, number = jobs[i].number;

		if (mlast < flast)
		{
			if (flast < start)
			{
				f.push_back(number);
				flast = end;
			}
			else
			{
				if (mlast < start)
				{
					m.push_back(number);
					mlast = end;
				}
			}
		}
		else
		{
			if (mlast < start)
			{
				m.push_back(number);
				mlast = end;
			}
			else
			{
				if (flast < start)
				{
					f.push_back(number);
					flast = end;
				}
			}

		}
	}

	cout << m.size() << ' ' << f.size() << endl;

	for (i = 0; i < m.size(); i++)
	{
		cout << m[i] + 1 << ' ';
	}
	cout << endl;

	for (i = 0; i < f.size(); i++)
	{
		cout << f[i] + 1 << ' ';
	}
}