#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m;
struct node {
	int a, w, name;
} a[500005], c[500005];
int t[500005];
bool comp1(node p, node q) {
	return p.w < q.w;
}
bool comp2(node p, node q) {
	return p.a < q.a;
}
struct SGT {
	int suma, l, r;
	ll sumb;
} b[2000006];
inline void update(int p) {
	b[p].suma = b[2 * p].suma + b[2 * p + 1].suma;
	b[p].sumb = b[2 * p].sumb + b[2 * p + 1].sumb;
}
inline void build(int p, int l, int r) {
	b[p].l = l;
	b[p].r = r;
	if (l == r) {
		b[p].suma = 1;
		b[p].sumb = a[l].w;
		return;
	}
	build(2 * p, l, (l + r) >> 1);
	build(2 * p + 1, ((l + r) >> 1) + 1, r);
	update(p);
}
inline void change(int p, int q) {
	if (b[p].l == b[p].r) {
		b[p].suma = b[p].sumb = 0;
		return;
	}
	if (q <= (b[p].l + b[p].r) >> 1) change(2 * p, q);
	else change(2 * p + 1, q);
	update(p);
}
inline int query(int p, int q) {
	if (b[p].sumb <= q) return b[p].suma;
	if (b[p].l == b[p].r) return 0;
	if (b[2 * p].sumb < q) return query(2 * p + 1, q - b[2 * p].sumb) + b[2 * p].suma;
	return query(2 * p, q);
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].a >> a[i].w;
		a[i].name = i;
		c[i] = a[i];
	}
	sort(a + 1, a + n + 1, comp1);
	sort(c + 1, c + n + 1, comp2);
	for (int i = 1; i <= n; i++) {
		t[a[i].name] = i;
	}
	int ct = 0, ans = 0, cnt, op;
	build(1, 1, n);
	for (int i = 1; i <= n; i++) {
		while (ct < n && c[ct + 1].a < i) {
			change(1, t[c[ct + 1].name]);
			ct++;
		}
		op = min(i, query(1, m));
		if (op > ans) {
			ans = op;
			cnt = i;
		}
	}
	cout << ans << "\n" << cnt << "\n";
	op = cnt;
	for (int i = 1; i <= n, op != 0; i++) {
		if (a[i].a >= cnt) {
			op--;
			cout << a[i].name << ' ';
		}
	}
}