#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

struct FT {
    vector<ll> s;
    FT(int n) : s(n) {}
    void update(int pos, ll dif) { // a[pos] += dif
        for (; pos < sz(s); pos |= pos + 1) s[pos] += dif;
    }
    ll query(int pos) { // sum of values in [0, pos)
        ll res = 0;
        for (; pos > 0; pos &= pos - 1) res += s[pos-1];
        return res;
    }
    int lower_bound(ll sum) {// min pos st sum of [0, pos] >= sum
        // Returns n if no sum is >= sum, or -1 if empty sum is.
        if (sum <= 0) return -1;
        int pos = 0;
        for (int pw = 1 << 25; pw; pw >>= 1) {
            if (pos + pw <= sz(s) && s[pos + pw-1] < sum)
                pos += pw, sum -= s[pos-1];
        }
        return pos;
    }
};

struct Topic
{
    int a,b,ind;
    auto operator<=>(const Topic&)const =default;
};

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    int q;
    cin>>q;
    while(q--)
    {
        int n,t;
        cin>>n>>t;
        vector<Topic> topics(n);
        for(int i=0;i<n;i++)
            cin>>topics[i].a>>topics[i].b,
            topics[i].ind=i+1;
        sort(all(topics));
        vi pref_a(n+1);
        for(int i=0;i<n;i++)
            pref_a[i+1]=pref_a[i]+topics[i].a;
        vector<vi> b_to_i(n+1);
        for(int i=0;i<n;i++)
            b_to_i[topics[i].b].pb(i);
        FT good_sum(n),good_cnt(n),bad_sum(n),bad_cnt(n);
        for(int i=0;i<n;i++)
            bad_sum.update(i,topics[i].a),
            bad_cnt.update(i,1);
        pii ans={0,0};
        for(int k=1;k<=n;k++)
        {
            if(pref_a[k]>t)
                break;
            for(int i:b_to_i[k])
                good_sum.update(i,topics[i].a),
                good_cnt.update(i,1),
                bad_sum.update(i,-topics[i].a),
                bad_cnt.update(i,-1);
            int lo=k,hi=n;
            while(lo<hi)
            {
                int mi=(lo+hi+1)/2;
                int my_good_cnt=good_cnt.query(mi);
                if(my_good_cnt>k)
                {
                    hi=mi-1;
                    continue;
                }
                int my_bad_cnt=k-my_good_cnt;
                int bad_pos=bad_cnt.lower_bound(my_bad_cnt)+1;
                int sum=good_sum.query(mi)+bad_sum.query(bad_pos);
                if(sum<=t)
                    lo=mi;
                else
                    hi=mi-1;
            }
            {
                int mi=(lo+hi+1)/2;
                int my_good_cnt=good_cnt.query(mi);
                int my_bad_cnt=k-my_good_cnt;
                ans=max(ans,pii(my_good_cnt,my_bad_cnt));
            }
        }
        auto[my_good_cnt,my_bad_cnt]=ans;
        int k=my_good_cnt+my_bad_cnt;
        cout<<my_good_cnt<<"\n";
        cout<<k<<"\n";
        for(auto[a,b,ind]:topics)
        {
            if(b>=k)
            {
                if(my_good_cnt)
                    cout<<ind<<" ",my_good_cnt--;
            }
            else
            {
                if(my_bad_cnt)
                    cout<<ind<<" ",my_bad_cnt--;
            }
        }
        cout<<"\n";
    }
}