#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
const int N=2e5+5;
struct {
    int rt,ls[N*32],rs[N*32],num[N*32],top; ll sum[N*32];
    void clear(){
        rep(i,1,top){
            ls[i]=rs[i]=num[i]=sum[i]=0;
        }
        top=0; rt=0;
    }
    int crt(int rt,int l,int r,int x){
        int now=++top;
        if(l==r){
            num[now]=num[rt]+1; sum[now]=sum[rt]+x; return now;
        }
        int mid=l+r>>1;
        if(mid>=x)ls[now]=crt(ls[rt],l,mid,x),rs[now]=rs[rt];
        else rs[now]=crt(rs[rt],mid+1,r,x),ls[now]=ls[rt];
        num[now]=num[ls[now]]+num[rs[now]]; sum[now]=sum[ls[now]]+sum[rs[now]];
        return now;
    }
    void ins(int x){
        rt=crt(rt,1,1e9,x);
    }
    void del(int rt,int l,int r,int x){
        assert(rt);
        sum[rt]-=x; --num[rt];
        if(l==r)return;
        int mid=l+r>>1;
        if(mid>=x)del(ls[rt],l,mid,x);
        else del(rs[rt],mid+1,r,x);
    }
    void del(int x){del(rt,1,1e9,x);}
    ll qu(int rt,int l,int r,int k){
        assert(k<=num[rt]);
        if(l==r)return 1ll*k*l;
        int mid=l+r>>1;
        if(num[ls[rt]]>k)return qu(ls[rt],l,mid,k);
        return qu(rs[rt],mid+1,r,k-num[ls[rt]])+sum[ls[rt]];
    }
    ll qu(int k){return qu(rt,1,1e9,k);}
}T1,T2;
int n;
struct info{
    int a,b,idx;
    bool operator < (const info&t)const &{
        return b<t.b;
    }
}q[N];
int res[N],cnt;
ll T;
info q1[N];
bool cmp(const info& a,const info& b){return a.a<b.a;}
void wk(int i,int v1,int v2){
    ll sum=0;
    cnt=0; assert(v1<=i && v2<=n-i);
    rep(j,1,i)q1[j]=q[j];
    sort(q1+1,q1+i+1,cmp);
    rep(i,1,v1)res[++cnt]=q1[i].idx,sum+=q1[i].a;
    int top=0;
    rep(j,i+1,n)q1[++top]=q[j];
    sort(q1+1,q1+top+1,cmp);
    rep(i,1,v2)res[++cnt]=q1[i].idx,sum+=q1[i].a;
    assert(sum<=T);
}
void slv(){
    cin>>n>>T;
    rep(i,1,n)cin>>q[i].a>>q[i].b,q[i].idx=i;
    sort(q+1,q+n+1);
    int x=0,id=-1;
    T1.clear(); T2.clear();
    rep(i,1,n)T2.ins(q[i].a);
    rep(i,1,n){
        auto [a,b,_]=q[i];
        T1.ins(a); T2.del(a);
        while(x<i){
            if(x+1<b-(n-i))break;
            if(T1.qu(x+1)+T2.qu(b-(x+1))<=T)++x,id=i;
            else break;
        }
    }
    cnt=0;
    if(id!=-1)wk(id,x,max(q[id].b-x,0));
    cout<<x<<'\n'<<cnt<<'\n';
    rep(i,1,cnt)cout<<res[i]<<' '; cout<<'\n';
}
signed main(){
    IOS
    int T;cin>>T;
    while(T--)slv();
}
/*
4 100
20 1
40 4
1 3
30 3
*/