#include <cstdio>
#include <algorithm>
using namespace std;
struct segmenttree {
    long long sumv[40010], cntv[40010];
    void pushup(int p) {
        cntv[p] = cntv[p << 1] + cntv[p << 1 | 1];
        sumv[p] = sumv[p << 1] + sumv[p << 1 | 1];
    }
    void modify(int p, int l, int r, int k, int x) {
        if (l == r) {
            sumv[p] += x;
            cntv[p]++;
            return;
        }
        int mid = (l + r) >> 1;
        if (k <= mid) {
            modify(p << 1, l, mid, k, x);
        } else {
            modify(p << 1 | 1, mid + 1, r, k, x);
        }
        pushup(p);
    }
    long long search(int p, int l, int r, long long x) {
        if (x >= sumv[p]) {
            return cntv[p];
        }
        if (l == r) {
            return 0;
        }
        int mid = (l + r) >> 1;
        if (x <= sumv[p << 1]) {
            return search(p << 1, l, mid, x);
        } else {
            return cntv[p << 1] + search(p << 1 | 1, mid + 1, r, x - sumv[p << 1]);
        }
    }
} sgt;
struct node {
    long long a, w, id;
} x[500010];
bool cmp(node a, node b) {
    return a.a > b.a;
}
bool cmpw(node a, node b) {
    return a.w < b.w;
}
long long C;
int n;
int main() {
    scanf("%d%lld", &n, &C);
    for (int i = 1; i <= n; i++) {
        scanf("%lld%lld", &x[i].a, &x[i].w);
        x[i].id = i;
    }
    sort(x + 1, x + n + 1, cmp);
    int ans = 0, ansid;
    for (int i = 1; i <= n; i++) {
        sgt.modify(1, 1, 10000, x[i].w, x[i].w);
        int now = min(sgt.search(1, 1, 10000, C), x[i].a);
        if (now > ans) {
            ans = now;
            ansid = i;
        }
    }
    printf("%d\n", ans);
    printf("%d\n", ans);
    sort(x + 1, x + ansid + 1, cmpw);
    for (int i = 1; i <= ans; i++) {
        printf("%lld ", x[i].id);
    }
    printf("\n");
    return 0;
}