#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

const int N=1010;

int n,m;
int v[N],w[N],f[N][N];

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++)
        {
            if(j>=v[i]) f[i][j]=max(f[i+1][j],f[i+1][j-v[i]]+w[i]);
            else f[i][j]=f[i+1][j];
        }

    int vol=m;
    for(int i=1;i<=n;i++)
    {

        if(vol-v[i]>=0&&f[i][vol]==f[i+1][vol-v[i]]+w[i])
        {
            cout<<i<<' ';
            vol-=v[i];
        }
        if(vol == 0)
        {
            break;
        }
    }

    return 0;
}