#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 500000 + 5;

int N, C;
struct Node {
    int a, w, i;
    bool operator < (const Node &t) const {
        return w < t.w;
    }
} a[MAX_N];
bool cmp(const Node &u, const Node &v) {
    return u.a < v.a;
}
priority_queue<Node> pq;

int main() {
    scanf("%d%d", &N, &C);
    for (int i = 1; i <= N; i ++) {
        scanf("%d%d", &a[i].a, &a[i].w);
        a[i].i = i;
    }
    sort(a + 1, a + 1 + N, cmp);
    long long w = 0, ans = 0;
    for (int i = N; i >= 1; i --) {
        w += a[i].w;
        pq.push(a[i]);
        while (pq.size() > a[i].a || w > C) {
            w -= pq.top().w;
            pq.pop();
        }
        ans = max(ans, (long long)pq.size());
    }
    for (; pq.size(); pq.pop());
    printf("%d\n", ans);
    printf("%d\n", ans);
    w = 0;
    for (int i = N; i >= 1; i --) {
        w += a[i].w;
        pq.push(a[i]);
        while (pq.size() > a[i].a || w > C) {
            w -= pq.top().w;
            pq.pop();
        }
        if (ans == pq.size()) {
            for (; pq.size(); pq.pop()) {
                printf("%d ", pq.top().i);
            }
            break;
        }
    }
    printf("\n");
    return 0;
}