#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll C;
int n;
const int MAXN = 5e5+10;
int a[MAXN],w[MAXN];
vector<int>ans;
bool calc(int m){
    vector<int>q;
    for(int i=1;i<=n;++i)if(a[i]>=m)q.push_back(i);
    sort(q.begin(),q.end(),[&](int x,int y){return w[x]<w[y];});
    ll now=C,cnt=0;
    vector<int>k;
    for(int x:q)if(w[x]<=now)now-=w[x],++cnt,k.push_back(x);
    if(cnt>=m){ans.clear();for(int x:k)ans.push_back(x);}
    return cnt>=m;
}
int solve(){
    int l=0,r=n,ans=0;
    while(l<=r){
        int mid=(l+r)>>1;
        if(calc(mid))ans=mid,l=mid+1;
        else r=mid-1;
    }
    return ans;
}
int main(){
    scanf("%d%lld",&n,&C);
    for(int i=1;i<=n;++i)scanf("%d%d",&a[i],&w[i]);
    calc(solve());
    int Cnt=0;
    for(int x:ans)Cnt+=a[x]>=ans.size();
    cout<<Cnt<<endl;
    printf("%d\n",ans.size());
    for(int v:ans)printf("%d ",v);
    return 0;
}