#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
void program();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
program();
}
//===================//
// begin program //
//===================//
const int MX = 5e5;
const int N = (1<<20);
ll n, w;
ld s[MX], q[MX];
ld fract[MX];
int sq[MX];
vi v;
ld endPrice;
int getWorkers(ld price) {
v.clear();
ld tot = 0.0;
int ans = 0;
endPrice = 0.0;
RE(i,n) if(fract[sq[i]] <= price) {
tot += price*q[sq[i]];
if(tot <= ld(w)+EPS) {
ans++;
v.pb(sq[i]+1);
endPrice = tot;
} else {
break;
}
}
return ans;
}
void program() {
IN(n,w);
RE(i,n) IN(s[i],q[i]);
RE(i,n) fract[i] = s[i]/q[i];
RE(i,n) sq[i] = i;
sort(sq,sq+n,[](int i, int j) {return q[i]<q[j];});
int ans = 0, bestAns = -1;
ld minEndPrice = 1e18;
RE(i,n) {
int res = getWorkers(fract[i]);
if(res > ans || (res == ans && endPrice <= minEndPrice)) {
ans = res;
bestAns = i;
minEndPrice = endPrice;
}
}
getWorkers(fract[bestAns]);
OUTL(ans);
sort(all(v));
FOR(u,v) OUTL(u);
}
