// Problem: A. 物品
// Contest: undefined - NOIP2024训练赛 14
// URL: http://noi.ac/contest/1166/problem/2441
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 5e5 + 10, M = 1e6 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;

int n, m, q, ans, sum;
int dp[N], cy[N];

struct node
{
	int fi, se, id;
}s[N];

// vector<int> e[N];

bool cmp(node a, node b) 
{
	if(a.fi == b.fi) return a.se < b.se;
	else return a.fi < b.fi;
}

inline bool check(int x)
{
	int l = lower_bound(cy + 1, cy + n + 1, x) - cy, res = 0;
	// cout << "l = " << l << '\n';
	priority_queue<int> pq;
	for(int i = l; i <= n; i ++)
	{
		if(s[i].se > m) continue;
		if(res + s[i].se <= m) pq.push(s[i].se), res += s[i].se;
		else
		{
			int now = pq.top(); 
			if(now < s[i].se) continue;
			else pq.pop(), pq.push(s[i].se), res -= now, res += s[i].se;
		}
	}
	return (int)pq.size() >= x;
}

inline void print(int x)
{
	int l = lower_bound(cy + 1, cy + n + 1, x) - cy, res = 0;
	// cout << "l = " << l << '\n';
	priority_queue<PII> pq;
	for(int i = l; i <= n; i ++)
	{
		if(s[i].se > m) continue;
		if(res + s[i].se <= m) pq.push({s[i].se, s[i].id}), res += s[i].se;
		else
		{
			int now = pq.top().fi; 
			if(now < s[i].se) continue;
			else pq.pop(), pq.push({s[i].se, s[i].id}), res -= now, res += s[i].se;
		}
	}
	cout << pq.size() << '\n';
	while(!pq.empty()) {cout << pq.top().se << ' '; pq.pop();}
	exit(0);
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {cin >> s[i].fi >> s[i].se; s[i].id = i, cy[i] = s[i].fi;}
	sort(s + 1, s + n + 1, cmp); sort(cy + 1, cy + n + 1);
	int l = 1, r = n, res = 0;
	while(l <= r)
	{
		int mid = l + r >> 1;
		if(check(mid)) res = mid, l = mid + 1;
		else r = mid - 1;
	}
	cout << res << '\n';
	print(res);
	// cout << check(2) << '\n';
	return 0;
}