#include<bits/stdc++.h>
using namespace std;
int T,n;
const int N=2000005;
#define ll long long
ll m;
int a[N],b[N],rk[N],rk2[N],cnt;
struct node
{
    int ls,rs,sz;
    ll v;
}t[N*30];
bool cmp(int x,int y)
{
    return b[x]<b[y];
}
bool cmpa(int x,int y)
{
    return a[x]==a[y]?b[x]<b[y]:a[x]<a[y];
}
void insert(int x,int l,int r,int p)
{
    t[x].sz++;
    t[x].v+=p;
    if (l==r)
        return;
    int mid=(l+r)/2;
    if (p<=mid)
    {
        if (!t[x].ls)
            t[x].ls=++cnt;
        insert(t[x].ls,l,mid,p);
    }
    else
    {
        if (!t[x].rs)
            t[x].rs=++cnt;
        insert(t[x].rs,mid+1,r,p);
    }
}
ll ask(int x,int l,int r,int p)
{
    if (!x)
        return 0;
    if (l==r)
        return (ll)p*l;
    int mid=(l+r)/2;
    if (t[t[x].ls].sz>=p)
        return ask(t[x].ls,l,mid,p);
    else
        return ask(t[x].rs,mid+1,r,p-t[t[x].ls].sz)+t[t[x].ls].v;
}
pair<int,ll> ask2(int x,int l,int r,int p)
{
    if (!x)
        return make_pair(0,0);
    if (r<=p)
        return make_pair(t[x].sz,t[x].v);
    int mid=(l+r)/2;
    if (p<=mid)
        return ask2(t[x].ls,l,mid,p);
    pair<int,ll> tmp=ask2(t[x].rs,mid+1,r,p);
    return make_pair(tmp.first+t[t[x].ls].sz,tmp.second+t[t[x].ls].v);
}
ll psum[N];
pair<int,ll> g[N];
int posofrk2[N];
void ins(int x,int y)
{
    for (int i=x;i<=n;i+=i&(-i))
    {
        g[i].first++;
        g[i].second+=y;
    }
    // for (;x<=n;x+=x&(-x))
    //     ++g[x];
}
pair<int,ll> chk(int x)
{
    pair<int,ll> ans={0,0};
    // int ans=0;
    for (;x;x-=x&(-x))
        // ans+=g[x];
    {
        ans.first+=g[x].first;
        ans.second+=g[x].second;
    }
    return ans;
}
vector<int> v[N];
void solve()
{
    scanf("%d%lld",&n,&m);
    int mx=1;
    for (int i=1;i<=n;++i){
        v[i].clear();
        g[i]={0,0};
    }
    for (int i=1;i<=n;++i)
    {
        scanf("%d%d",&a[i],&b[i]);
        v[b[i]].push_back(i);
        mx=max(mx,a[i]);
        rk[i]=i;
        rk2[i]=i;
    }
    sort(rk+1,rk+1+n,cmp);
    sort(rk2+1,rk2+1+n,cmpa);
    for (int i=1;i<=n;++i)
        psum[i]=psum[i-1]+a[rk2[i]];
    for (int i=1;i<=n;++i)
        posofrk2[rk2[i]]=i;
    for (int x=1;x<=cnt;++x)
        t[x].ls=t[x].rs=t[x].v=t[x].sz=0;
    cnt=1;
    int mxp=0,mxsum=0,mxq=0;
    for (int p=1;p<=n;++p)
    {
        for (int i:v[p])
        {
            insert(1,1,mx,a[i]);
            ins(posofrk2[i],a[i]);
        }
        if (psum[p]>m)
            break;
        int l=0,r=p;
        while (l<=r)
        {
            int mid=(l+r)/2;
            // ll ressum=m-psum[mid];
            auto q=chk(mid);
            if (t[1].sz+mid-q.first>=p)
            {
                ll o=ask(1,1,mx,p-mid+q.first);
                if (o+psum[mid]-q.second<=m)
                    r=mid-1;
                else
                    l=mid+1;
            }
            else
                l=mid+1;
        }
        int tmp=p-(l-chk(l).first);
        if (tmp>mxsum)
        {
            mxp=p;
            mxsum=tmp;
            mxq=l;
        }
    }
    if (mxp==0)
    {
        puts("0");
        puts("0");
        puts("");
    }
    else
    {
        printf("%d\n",mxsum);
        printf("%d\n",mxp);
        int k=mxp;
        for (int i=1;i<=n&&k;++i)
            if (i<=mxq||b[rk2[i]]<=mxp)
            {
                --k;
                printf("%d ",rk2[i]);
            }
        puts("");
    }
}
int main()
{
    scanf("%d",&T);
    while (T--)
    {
        solve();
    }
    return 0;
}