#include <iostream>
#include <queue>
#include <algorithm>
#define ll long long

using namespace std;

struct adat
{
	ll el, veg, poz;
};

vector <adat> x;

bool sorts(const adat& a, const adat& b)
{
	return a.veg < b.veg;
}

int main()
{
	ll n, h;
	cin >> n >> h;
	for (ll i = 1; i <= n; ++i)
	{
		ll a, b;
		cin >> a >> b;
		x.push_back({ a, b, i });
	}
	sort(x.begin(), x.end(), sorts);
	ll m1v = 0, m2v = 0, m1 = 0, m2 = 0;
	deque <ll> p1, p2;
	for (ll i = 0; i < n; ++i)
	{
		if (m1v < x[i].el && x[i].veg <= h)
		{
			m1v = x[i].veg;
			++m1;
			p1.push_front(x[i].poz);
		}
		else if (m2v < x[i].el && x[i].veg <= h)
		{
			m2v = x[i].veg;
			++m2;
			p2.push_front(x[i].poz);
		}
	}
	cout << m1 << " " << m2 << endl;
	for (ll i = p1.size() - 1; i >= 0; --i)
		cout << p1[i] << " ";
	cout << endl;
	for (ll i = p2.size() - 1; i >= 0; --i)
		cout << p2[i] << " ";

	return 0;
}