#include <bits/stdc++.h>

using namespace std;

#define int long long
#define x first
#define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 500010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, C;
array<int, 2> a[N];

bool check(int mid)
{
    priority_queue<int, vector<int>, greater<int>> heap;
    for (int i = 1; i <= n; i ++)
        if (a[i][0] >= mid) heap.emplace(a[i][1]);

    if (heap.size() < mid) return false;
    int cur = 0, cnt = 0;
    while (!heap.empty() && cnt < mid)
    {
        if (cur + heap.top() <= C)
            cnt ++, cur += heap.top(), heap.pop();
        else return false;
    }
    return cnt >= mid;
}

void print(int res)
{
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    for (int i = 1; i <= n; i ++)
        if (a[i][0] >= res) heap.emplace(a[i][1], i);
    printf("%d\n%d\n", res, res);

    int cur = 0, cnt = 0;
    while (!heap.empty() && cnt < res)
    {
        if (cur + heap.top().x <= C)
        {
            printf("%d ", heap.top().y);
            cnt ++, cur += heap.top().x, heap.pop();
        }
    }
}

signed main()
{
    read(n, C);
    for (int i = 1; i <= n; i ++) read(a[i][0], a[i][1]);
    sort(a + 1, a + 1 + n, [](const array<int, 2> &a, const array<int, 2> &b) { return a[0] == b[0] ? a[1] < b[1] : a[0] < b[0]; });

    int l = 0, r = n, res = 0;
    while (l <= r)
    {
        int mid = l + r >> 1;
        if (check(mid)) res = mid, l = mid + 1;
        else r = mid - 1;
    }
    print(res);

    return 0;
}