#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f1 first
#define s2 second
// #define int long long
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using pl = pair<ll, ll>;
const int MAX = 5e5 + 69;
struct Segtree
{
int n;
pair<ll, int> st[1 << 20];
Segtree() {}
Segtree(int n_) : n(n_) { memset(st, 0, sizeof(st)); }
inline void add(int p, ll val)
{
const auto add_ = [&](const auto &self, int node, int l, int r) -> void
{
if (l > p || r < p)
return;
if (p <= l && r <= p)
{
st[node].f1 += val; st[node].s2++;
return;
}
int mid = (l + r) >> 1;
self(self, node << 1, l, mid);
self(self, node << 1 | 1, mid+1, r);
st[node].f1 = st[node << 1].f1 + st[node << 1 | 1].f1;
st[node].s2 = st[node << 1].s2 + st[node << 1 | 1].s2;
};
add_(add_, 1, 1, n);
}
inline pair<int, ld> query(ll val, int S)
{
int res = 0;
const auto query_ = [&](const auto &self, int node, int l, int r) -> void
{
if (st[node].f1 * S <= val)
{
res += st[node].s2;
val -= st[node].f1 * S;
return;
}
if (l == r)
return;
int mid = (l + r) >> 1;
if (st[node << 1].f1 * S <= val)
{
res += st[node << 1].s2;
val -= st[node << 1].f1 * S;
self(self, node << 1 | 1, mid+1, r);
}
else self(self, node << 1, l, mid);
};
query_(query_, 1, 1, n);
return { res, val };
}
};
int32_t main()
{
ios :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
ll W;
cin >> N >> W;
vector<array<int, 4>> V(N);
for (auto &[s, q, i, idx] : V)
cin >> s >> q;
for (int i = 0; i < N; ++i)
V[i][3] = i+1;
sort(V.begin(), V.end(), [](auto &x, auto &y){
return x[1] < y[1];
});
for (int i = 0; i < N; ++i)
V[i][2] = i+1;
sort(V.begin(), V.end(), [](auto &x, auto &y){
return 1ll * x[0] * y[1] < 1ll * y[0] * x[1];
});
Segtree st(N);
pair<int, ld> res = {0, 0};
int id = -1;
for (int j = 0; j < N; ++j)
{
auto &[s, q, i, idx] = V[j];
st.add(i, q);
pair<int, ld> cur = st.query(1ll * W * q, s);
cur.s2 /= q;
if (cur > res)
res = cur, id = j;
}
sort(V.begin(), V.begin()+id+1, [](auto &x, auto &y){
return x[1] < y[1];
});
cout << res.f1 << '\n';
for (int i = 0; i < res.f1; ++i)
cout << V[i][3] << '\n';
return 0;
}
