/**
* @author: KinNa
* @date: none
*/

bool CalcM1;
#include <bits/stdc++.h>
#define rep(i, a, b) for (long long i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (long long i = (a), i##end = (b); i >= i##end; --i)
#define file(x) freopen(#x".in", "r", stdin); freopen(#x".out", "w", stdout);
#define fi first
#define se second
#define LOOK_TIME cerr << (1.0 * clock() / CLOCKS_PER_SEC) << endl;
using namespace std;
using LL = long long;
using iLL = __int128;
using PII = pair <int, int>;
const int N = 5e5 + 10;

template <typename T> T Read(T &x) {
	x = 0; bool f = 0; char c = getchar(); while (!isdigit(c)) f = c == '-', c = getchar();
	while (isdigit(c)) x = x * 10 + c - '0', c = getchar(); return x = f ? -x : x;
}
template <typename T> T R(T &x) {return Read(x);}
template <typename T, typename... Tr> void R(T &x, Tr&... y) {Read(x); R(y...);}

int n, C, ans, ansm;
struct Node {int a, w, id;} qwq[N];

bool check(int m) {
	int W = 0, now = 0;
	rep(i, 1, n) if (qwq[i].a >= m) {
		if (W + qwq[i].w > C) break;
		W += qwq[i].w; ++now;
		if (now == m) break;
	}
	if (now > ans) ans = now, ansm = m;
	return now == m;
}

bool CalcM2;
int main() {
#ifndef ONLINE_JUDGE
	file(a)
#endif
	cerr << (&CalcM2 - &CalcM1) / 1048576.0 << "\n";

	R(n, C);
	rep(i, 1, n) R(qwq[i].a, qwq[i].w), qwq[i].id = i;
	sort(qwq + 1, qwq + n + 1, [&](Node A, Node B) {return A.w < B.w;});
	int l = 1, r = n, res = -1;
	while (l <= r) {
		int mid = l + r >> 1;
		if (check(mid)) res = mid, l = mid + 1;
		else r = mid - 1;
	}
	cout << ans << endl << ans << endl;
	int W = 0, now = 0;
	rep(i, 1, n) if (qwq[i].a >= ansm) {
		if (W + qwq[i].w > C) break;
		cout << i << " ";
		W += qwq[i].w; ++now;
		if (now == ansm) break;
	}
	return 0;
}