#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int MN=5e5+5;
ll n,c,p[MN];
struct node{ll a,w,id;}q[MN];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
bool cmpa(node x, node y){return x.a==y.a?x.w<y.w:x.a<y.a;}
bool cmpw(node x, node y){return x.w==y.w?x.a<y.a:x.w<y.w;}
bool check(ll x){
    if(n-p[x]+1<x) return false;
    sort(q+1+p[x],q+1+n,cmpw);
    ll num=0;
    for(int i=p[x],j=1; j<=x; i++,j++) num+=q[i].w;
    sort(q+1+p[x],q+1+n,cmpa);
    return num<=c;
}
void print(ll x){
    sort(q+1+p[x],q+1+n,cmpw);
    for(int i=p[x],j=1; j<=x; i++,j++) write(q[i].id),putchar(' ');
    putchar('\n');
}
int main(){
    n=read();c=read();
    for(int i=1; i<=n; i++) q[i].a=read(),q[i].w=read(),q[i].id=i;
    sort(q+1,q+1+n,cmpa);
    for(int i=min(1ll*500000,n),j=n; i>=1; i--){
        while(q[j].a>=i) j--;
        p[i]=j+1;
    }
    ll l=0,r=n;
    while(l<=r){
        ll mid=l+r>>1;
        if(check(mid)) l=mid+1;
        else r=mid-1;
    }
    write(r);putchar('\n');write(r);putchar('\n');print(l-1);
    return 0;
}