#include<bits/stdc++.h>
using namespace std;
pair<int,int>p[500005],q[500005],tmp[500005];
typedef long long ll;
priority_queue<int>s;
ll sum=0;
int main(){
//	freopen("backpack.in","r",stdin);
//	freopen("backpack.out","w",stdout);
	int n,C;
	scanf("%d%d",&n,&C);
	for(int i=1;i<=n;i++)scanf("%d%d",&p[i].first,&p[i].second);
	for(int i=1;i<=n;i++)tmp[i]=p[i];
	sort(p+1,p+n+1);
	int ans=0,pos=n;
	for(int m=n;m>=1;m--){
		while(p[pos].first>=m && pos>=1){
			s.push(p[pos].second);
			sum+=p[pos].second;
			while(sum>C){
				sum-=s.top();
				s.pop();
			}
			pos--;
		}
		ans=max(ans,min(m,(int)s.size()));
	}
	printf("%d\n%d\n",ans,ans);
	int cnt=0;
	for(int i=1;i<=n;i++)if(tmp[i].first>=ans)q[++cnt]=make_pair(tmp[i].second,i);
	sort(q+1,q+cnt+1);
//	for(int i=1;i<=cnt;i++)printf("%d %d\n",q[i].first,q[i].second);
	for(int i=1;i<=ans;i++)printf("%d ",q[i].second);
//	long long sum=0;
//	for(int i=1;i<=ans;i++)sum+=q[i].first;
//	printf("%lld",sum);
	return 0;
}