//
//  na 2441.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/26.
//

#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 5e5 + 5;
int n, C, inv, ansm, ansval;
inline int rd(){
    int v = 0; char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    do{
        v = (v << 3) + (v << 1) + (r ^ 48);
        r = getchar();
    }while(r - 48 < 10u);
    return v;
}
void pr(int x){
    if(x < 10)
        putchar(x ^ 48);
    else{
        pr(x / 10);
        putchar((x % 10) ^ 48);
    }
}
struct Pkg{
    int a, w, id;
    inline void read(int id){ a = rd(); w = rd(); this->id = id; }
    inline bool operator < (const Pkg &other) const{ return w < other.w; }
}ps[maxn];
struct Cmpa{
    inline bool operator() (const Pkg &a, const Pkg &b){ return a.a < b.a; }
};
inline bool cmpa(const Pkg &a, const Pkg &b){ return a.a < b.a; }
priority_queue<Pkg, vector<Pkg>, Cmpa> pack;
priority_queue<Pkg> rest;
vector<int> ans;
int main(){
    cin.tie(0)->sync_with_stdio(false);
    n = rd(); C = rd();
    for(int i = 0; i < n; ++i){
        ps[i].read(i + 1);
        rest.push(ps[i]);
    }
    for(int i = 1; i <= n; ++i){
        while(!pack.empty() && pack.top().a < i){
            inv -= pack.top().w;
            pack.pop();
        }
        while(pack.size() < i && !rest.empty() && inv + rest.top().w <= C){
            if(rest.top().a < i){
                rest.pop();
                continue;
            }
            inv += rest.top().w;
            pack.push(rest.top());
            rest.pop();
        }
        if(pack.size() > ansval){
            ansval = int(pack.size());
            ansm = i;
        }
    }
    pr(ansval); putchar('\n');
    sort(ps, ps + n, cmpa);
    int p = 0;
    while(ps[p].a < ansm)
        ++p;
    sort(ps + p, ps + n);
    inv = 0;
    while(p < n && inv + ps[p].w <= C){
        inv += ps[p].w;
        ans.push_back(ps[p].id);
        ++p;
    }
    pr(int(ans.size())); putchar('\n');
    for(int i: ans){
        pr(i); putchar(' ');
    }
    putchar('\n');
    fflush(stdout);
    return 0;
}