#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second
struct Obj{
ll s; // min salary
ll q; // skill
int i;
};
bool cmp(Obj&a,Obj&b){
return a.s*b.q<b.s*a.q;
}
void solve(){
int n;
ll w;
cin>>n>>w;
vector<Obj>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i].s>>arr[i].q;
arr[i].i=i+1;
}
sort(arr.begin(),arr.end(),cmp);
int res=0;
int opt=0;
ll m1=0,m2=1; // spends m1/m2
for(int i=0;i<n;i++){
vector<ll>vals;
for(int j=0;j<i;j++)
vals.push_back(arr[j].q);
sort(vals.begin(),vals.end());
ll cost=arr[i].q;
if(cost*arr[i].s>w*arr[i].q)
continue;
int cres=0;
while(cres<(int)vals.size()){
if((cost+vals[cres])*arr[i].s<=w*arr[i].q){
cost+=vals[cres];
cres++;
}else{
break;
}
}
if(cres+1>res){
res=cres+1;
opt=i;
m1=cost*arr[i].s;
m2=arr[i].q;
}else if(cres+1==res){
if(cost*arr[i].s*m2<m1*arr[i].q){
opt=i;
m1=cost*arr[i].s;
m2=arr[i].q;
}
}
}
cout<<res<<"\n";
if(res){
cout<<arr[opt].i<<"\n";
int i=opt;
vector<ll>vals;
vector<int>idx;
for(int j=0;j<i;j++){
vals.push_back(arr[j].q);
idx.push_back(arr[j].i);
}
sort(vals.begin(),vals.end());
ll cost=arr[i].q;
int cres=0;
while(cres<(int)vals.size()){
if((cost+vals[cres])*arr[i].s<=w*arr[i].q){
cost+=vals[cres];
cout<<idx[cres]<<"\n";
cres++;
}else{
break;
}
}
}
}
int main(){
ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
//freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
int t=1;//cin>>t;
while(t--)solve();
return 0;
}
/*
4 100
5 1000
10 100
8 10
20 1
2
3 4
1 2
1 3
1 3
3
3 40
10 1
10 2
10 3
2
5 30
1 1
2 2
4 4
8 8
16 16
4
2 2
2 2
1 1
1
*/
