#include <stdio.h>
#include <algorithm>
using namespace std;
FILE*f=fopen("rucsac.in","r");
FILE*g=fopen("rucsac.out","w");

int k,gmax,n;
struct ob{
int o,g;
int c;
}v[20002];
int x[20001];
int cmax;
int compare (ob a,ob b){
return a.c*b.g>b.c*a.g;

}
int main()
{
   fscanf(f,"%d%d",&n,&gmax);
    for(int i=1;i<=n;i++){

        fscanf(f,"%d%d",&v[i].g,&v[i].c);
        v[i].o=i;
    }
    sort(v+1,v+n+1,compare);int i=0;
    while(gmax>0&&i<n){
        i++;
        if(v[i].g<=gmax) {gmax-=v[i].g;
        cmax=cmax+v[i].c;
        x[++k]=v[i].o;
        }

    }
    fprintf(g,"%d\n",cmax);
    sort(x+1,x+k+1);
for(i=1;i<=k;i++) fprintf(g,"%d ",x[i]);
    return 0;
}