#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <set>
typedef long long llong;
const int MAXN = 500000 + 10;
const int INF = 1e9;
int n;
llong s[MAXN];
llong q[MAXN];
int perm[MAXN];
std::priority_queue <std::pair <llong,int>> pq;
llong sum;
llong w;
void solve()
{
std::iota(perm + 1, perm + 1 + n, 1);
std::sort(perm + 1, perm + 1 + n, [&](int x, int y)
{
return s[x] * q[y] < s[y] * q[x];
});
int ans = 0;
int cnt = 0;
int maxPos = 0;
double minMoney = 0;
for (int i = 1 ; i <= n ; ++i)
{
pq.push({q[perm[i]], perm[i]});
sum += q[perm[i]];
cnt++;
while (sum * s[perm[i]] > w * q[perm[i]])
{
cnt--;
sum -= pq.top().first;
pq.pop();
}
if (cnt > ans || (cnt == ans && (double)(sum * s[perm[i]]) / q[perm[i]] < minMoney))
{
minMoney = (double)(sum * s[perm[i]]) / q[perm[i]];
maxPos = i;
ans = cnt;
}
}
while (pq.size())
{
pq.pop();
}
sum = 0;
cnt = 0;
std::cout << ans << '\n';
for (int i = 1 ; i <= maxPos ; ++i)
{
pq.push({q[perm[i]], perm[i]});
sum += q[perm[i]];
cnt++;
while (sum * s[perm[i]] > w * q[perm[i]])
{
cnt--;
sum -= pq.top().first;
pq.pop();
}
}
std::vector <int> sol;
while (pq.size())
{
sol.push_back(pq.top().second);
// std::cout << pq.top().second << '\n';
pq.pop();
}
std::sort(sol.begin(), sol.end());
// long double
for (const int &idx : sol)
{
std::cout << idx << '\n';
}
}
void input()
{
std::cin >> n >> w;
for (int i = 1 ; i <= n ; ++i)
{
std::cin >> s[i] >> q[i];
}
}
void fastIOI()
{
std::ios_base :: sync_with_stdio(0);
std::cout.tie(nullptr);
std::cin.tie(nullptr);
}
int main()
{
fastIOI();
input();
solve();
return 0;
}
