#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 10000;
int read(){
	int  x= 0;char c = getchar();
	while(c<'0' or c>'9')c=getchar();
	while('0'<=c and c<='9')x = x*10+(c^48),c = getchar();
	return x;
}struct node{
	int l,r;int sum1 = 0,sum2 =0 ;
	void add(int num){
		sum1+=num;sum2+=l*num;
	}
}tree1[200005],tree2[200005];
int tong[200005];
int n,c;
int a[500005],w[500005];
void push_up1(int k){
	tree1[k].sum1 = tree1[k<<1].sum1+tree1[k<<1|1].sum1;
	tree1[k].sum2 = tree1[k<<1].sum2+tree1[k<<1|1].sum2;
}void build1(int l,int r,int k){
	tree1[k].l = l,tree1[k].r = r;
	if(l+1 == r){
		tree1[k].add(tong[l]);return;
	}build1(l,l+r>>1,k<<1),build1(l+r>>1,r,k<<1|1);
	push_up1(k);return;
}void upd1(int pos,int add,int k){
	int l = tree1[k].l,r = tree1[k].r;
	if(l>pos or pos>=r)return ;
	if(l+1 == r and l == pos){
		tree1[k].add(add);return;
	}upd1(pos,add,k<<1),upd1(pos,add,k<<1|1);push_up1(k);
}int query1(int k,int x){
	if(x == 0)return 0;
	if(tree1[k].l+1 == tree1[k].r){
		return tree1[k].l*x;
	}int s1 = tree1[k<<1].sum1;
	if(x<=s1)return query1(k<<1,x);
	else return query1(k<<1|1,x-s1)+tree1[k<<1].sum2;
}void push_up2(int k){
	tree2[k].sum1 = tree2[k<<1].sum1+tree2[k<<1|1].sum1;
	tree2[k].sum2 = tree2[k<<1].sum2+tree2[k<<1|1].sum2;
}void build2(int l,int r,int k){
	tree2[k].l = l,tree2[k].r = r;
	if(l+1 == r){
		return;
	}build2(l,l+r>>1,k<<1),build2(l+r>>1,r,k<<1|1);
	push_up2(k);return;
}void upd2(int pos,int add,int k){
	int l = tree2[k].l,r = tree2[k].r;
	if(l>pos or pos>=r)return ;
	if(l+1 == r and l == pos){
		tree2[k].add(add);return;
	}upd2(pos,add,k<<1),upd2(pos,add,k<<1|1);push_up2(k);
}int query2(int k,int x){
	//cout << tree2[k].l << " " << x << " " << k << endl;
	if(x == 0)return 0;
	if(tree2[k].l+1 == tree2[k].r){
	//	cout << " "  << endl<< tree2[k].l << "   " << x << endl;
		return tree2[k].l*x;
	}int s1 = tree2[k<<1].sum1;//cout << s1  << "  " << x<< endl;
	if(x<=s1)return query2(k<<1,x);
	else return query2(k<<1|1,x-s1)+tree2[k<<1].sum2;
}vector<int>p[500005];
signed main(){
	n = read(),c = read();
	for(int i = 1;i<=n;i++)a[i] = read(),w[i] = read();
	for(int i = 1;i<=n;i++)tong[w[i]]++;
	build1(1,N+1,1),build2(1,N+1,1);
	for(int i = 1;i<=n;i++)p[a[i]].push_back(w[i]);
//	cout << query1(1,2) << endl;
	int sz =0,tot =0,mx =0 ,mxpos =0 ;
	for(int i = 1;i<=n;i++){
		for(int j =0;j<p[i-1].size();j++){tot++;
			upd1(p[i-1][j],-1,1),upd2(p[i-1][j],1,1);
		}while(sz<tot and ((i-sz>n-tot) or (query1(1,i-sz)+query2(1,sz)>c)))sz++;
	//	cout << i << " " << sz  <<" " << tot << " " << query2(1,sz) <<" " << query1(1,i-sz)<< endl;
		if(i-sz>mx)mx = i-sz,mxpos = i;
		if(sz == tot and (((i-sz>n-tot) or (query1(1,i-sz)+query2(1,sz)>c))))break;
	}vector<pair<int,int> >p1,p2;
	for(int i = 1;i<=n;i++){
		if(a[i]<mxpos)p1.push_back({w[i],i});
		else p2.push_back({w[i],i});
	}vector<int>ans;
	sort(p1.begin(),p1.end());sort(p2.begin(),p2.end());
//	for(int i =0;i<p2.size();i++)cout << p2[i].first << " " << p2[i].second << endl;cout << endl;
	cout << mx << endl << mxpos << endl;
	for(int i=0;i<mx;i++)ans.push_back(p2[i].second);
	for(int i=0;i<mxpos-mx;i++)ans.push_back(p1[i].second);
	sort(ans.begin(),ans.end());
	for(int i =0;i<ans.size();i++)printf("%lld ",ans[i]);cout << endl;
	return 0;
}