#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tpi;
const int I=1e15;
main(){
  ios::sync_with_stdio(false);
  int q; cin>>q;
  while(q--){
    int n,t; cin>>n>>t;
    vector<tpi> a(n);
    for(int i=0;i<n;i++)
      cin>>get<1>(a[i])>>get<0>(a[i]),get<2>(a[i])=i;
    sort(a.begin(),a.end());
    vector<int> v;
    auto pd=[&](int m){
      if(!m)return true;
      vector<int> r(n),s(n);
      for(int i=0;i<n;i++)
        r[i]=max(get<0>(a[i])-m,0ll);
      priority_queue<int> q;
      for(int i=n-1,c=0;~i;i--){
        if(n-1-i<r[i])s[i]=I;
        else{
          while(q.size()>r[i])c-=q.top(),q.pop();
          s[i]=c;
        }
        q.emplace(get<1>(a[i])),c+=get<1>(a[i]);
      }
      while(!q.empty())q.pop();
      for(int i=0,c=0;i<n;i++){
        q.emplace(get<1>(a[i])),c+=get<1>(a[i]);
        if(q.size()>m)c-=q.top(),q.pop();
        if(i+1>=m&&c+s[i]<=t){
          v.clear();
          priority_queue<pii> q;
          for(int j=0;j<=i;j++)
            q.emplace(get<1>(a[j]),get<2>(a[j]));
          while(q.size()>m)q.pop();
          while(!q.empty())v.emplace_back(q.top().second),q.pop();
          for(int j=i+1;j<n;j++)
            q.emplace(get<1>(a[j]),get<2>(a[j]));
          while(q.size()>r[i])q.pop();
          while(!q.empty())v.emplace_back(q.top().second),q.pop();
          return true;
        }
      }
      return false;
    };
    int l=0,r=n;
    while(l<r){
      int m=l+r+1>>1;
      if(pd(m))l=m;
      else r=m-1;
    }
    cout<<l<<'\n'<<v.size()<<'\n';
    for(int i:v)cout<<i+1<<' ';
    cout<<'\n';
  }
  return 0;
}