/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 5e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;


struct Node{
    int a,w,id;
};

Node p[N],t[N];
int n,c;

bool cmp(Node a,Node b){
    return a.w<b.w;
}

int check(int m,bool final=0){
    int tot=0;
    for(int i=1;i<=n;i++){
        if(m<=t[i].a)p[++tot]=t[i];
    }


    sort(p+1,p+tot+1,cmp);
    int sum=0;
    int cc=c;
    
    for(int i=1;i<=min(tot,m);i++){
        if(p[i].w<=cc){
            cc-=p[i].w;
            sum++;
        }
    }
    if(final){
        cout<<sum<<'\n'<<m<<'\n';
        for(int i=1;i<=sum;i++){
            cout<<p[i].id<<' ';
        }
    }
    return sum;
}

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);


    n=rd,c=rd;
    for(int i=1;i<=n;i++){
        t[i]={rd,rd,i};
    }
    
    // for(int i=1;i<=n;i++){
    //     cdbg(i,check(i));
    // }

    int l=1,r=n;
    int res=0;
    while(l<=r){
        int mid=l+r>>1;
        if(check(mid)>=check(mid+1))res=mid,r=mid-1;
        else l=mid+1;
    }

    check(res,1);




}