#include<iostream>
using namespace std;
const int N=1e5+10;
int v[N],w[N],f[1010][1010],a[N],res,n,m,lim;//f[i][j]表示
bool flag;

int main(){

    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>v[i]>>w[i];
    }
    for(int i=n;i>=1;i--){
        for(int j=0;j<=m;j++){
            f[i][j]=f[i+1][j];
            if(v[i]<=j) f[i][j]=max(f[i][j],f[i+1][j-v[i]]+w[i]);
        }
    }
    //cout<<f[1][m];
//  dfs(1);
    int curr=m;
    for(int i=1;i<=n;i++){

        if(v[i]<=curr&&f[i][curr]==f[i+1][curr-v[i]]+w[i]){
            cout<<i<<" ";
            curr-=v[i];
        }
    }
}