#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;

const int maxn = 210000;

int n,T;
struct node
{
	int a,ac,b,i;
}a[maxn];
inline bool cmpa(const node &k1,const node &k2){ return k1.a<k2.a; }
inline bool cmpi(const node &k1,const node &k2){ return k1.i<k2.i; }

int val[maxn];

struct segment
{
	int sum[maxn<<2],num[maxn<<2],leftc[maxn<<2];
	int loc,ci;
	void build(const int x,const int l,const int r)
	{
		sum[x]=num[x]=leftc[x]=0;
		if(l==r) return;
		int mid=(l+r)>>1,lc=x<<1,rc=lc|1;
		build(lc,l,mid); build(rc,mid+1,r);
	}
	void upd(const int x,const int l,const int r)
	{
		if(l==r)
		{
			num[x]+=ci;
			sum[x]+=val[l]*ci;
			leftc[x]= num[x]>0?val[l]:0;
			return;
		}
		int mid=(l+r)>>1,lc=x<<1,rc=lc|1;
		if(loc<=mid) upd(lc,l,mid);
		else upd(rc,mid+1,r);
		sum[x]=sum[lc]+sum[rc];
		num[x]=num[lc]+num[rc];
		leftc[x]= leftc[lc]>0?leftc[lc]:leftc[rc];
	}
	int qx;
	int querysum(const int x,const int l,const int r)
	{
		if(qx==0) return 0;
		if(num[x]<=qx)
		{
			qx-=num[x];
			return sum[x];
		}
		if(l==r)
		{
			int ret= qx*val[l];
			qx=0;
			return ret;
		}
		int mid=(l+r)>>1,lc=x<<1,rc=lc|1;
		return querysum(lc,l,mid)+querysum(rc,mid+1,r);
	}
/*	int querynum(const int x,const int l,const int r)
	{
		if(!leftc[x] || qx<leftc[x]) return 0;
		if(sum[x]<=qx)
		{
			qx-=sum[x];
			return num[x];
		}
		if(l==r)
		{
			int ret= qx/val[l];
			qx=0;
			return ret;
		}
		int mid=(l+r)>>1,lc=x<<1,rc=lc|1;
		return querynum(lc,l,mid)+querynum(rc,mid+1,r);
	}*/
}seg0,seg1; int mxa;

int QX,pqs,pqn;
int querynum(const int x,const int l,const int r)
{
	if(QX==0) return 0;
	int LC;
	if( !seg0.leftc[x] || !seg1.leftc[x] ) LC=seg0.leftc[x]|seg1.leftc[x];
	else LC= min( seg0.leftc[x], seg1.leftc[x] );
	
	if( LC==0 || LC>QX ) return 0;
	
	if( seg0.sum[x]+max( seg1.sum[x]-pqs,0ll )<=QX )
	{
		int ret= seg0.num[x]+ ( pqn>=seg1.num[x] ? 0: seg1.num[x]-pqn );
		
		QX-= seg0.sum[x]+max( seg1.sum[x]-pqs,0ll ) ;
		if(pqn>=seg1.num[x]) pqn-=seg1.num[x];
		else pqn=0;
		if(pqs>=seg1.sum[x]) pqs-=seg1.sum[x];
		else pqs=0;
		return ret;
	}
	if(l==r)
	{
		int ret= QX/val[l];
		QX=0;
		return ret;
	}
	int mid=(l+r)>>1,lc=x<<1,rc=lc|1;
	return querynum(lc,l,mid)+querynum(rc,mid+1,r);
}

vector<int>V[maxn];

int check(const int qk,const int mid)
{
	seg1.qx=mid;
	int sum=seg1.querysum(1,1,mxa);
	if(sum>T) return 0;
	QX= T-sum; pqs=sum,pqn=mid;
	int num= querynum(1,1,mxa);
	if( num+mid >= qk ) return 1;
	else return 0;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int Tcase; cin>>Tcase;
	while(Tcase--)
	{
		cin>>n>>T;
		for(int i=1;i<=n;i++) 
		{
			cin>>a[i].a>>a[i].b;
			a[i].i=i;
		}
		sort(a+1,a+n+1,cmpa);
		for(int i=1;i<=n;i++)
		{
			if(a[i].a!=a[i-1].a) 
			{
				a[i].ac=a[i-1].ac+1;
				val[a[i].ac]= a[i].a;
			}
			else a[i].ac=a[i-1].ac;
		}
		mxa = a[n].ac;
		sort(a+1,a+n+1,cmpi);
		
		seg0.build(1,1,mxa);
		seg1.build(1,1,mxa);
		for(int i=1;i<=n;i++)
		{
			seg0.loc=a[i].ac,seg0.ci=1,seg0.upd(1,1,mxa);
		}
		for(int i=1;i<=n;i++)
		{
			vector<int>_; V[i].swap(_);
		}
		for(int i=1;i<=n;i++) V[a[i].b].push_back(i);
		
		int ansk=-1,ansn=-1;
		for(int k=1,nowk=0;k<=n;k++)
		{
			for(auto i:V[k])
			{
				seg0.loc=a[i].ac,seg0.ci=-1;
				seg0.upd(1,1,mxa);
				
				seg1.loc=a[i].ac,seg1.ci=1;
				seg1.upd(1,1,mxa);
				nowk++;
			}
			
			int l=1,r=nowk;
			while(l<=r)
			{
				int mid=(l+r)>>1;
				if(check(k,mid)) l=mid+1;
				else r=mid-1;
			}
			l--;
			
			if(l>=ansn) ansk=k,ansn=l;
		}
		
		//cout<<ansk<<' '<<ansn<<'\n';
		
		cout<<ansn<<'\n';
		sort(a+1,a+n+1,cmpa);
		vector<int>vis(n+5), ans;
		int now=0;
		for(int i=1,cnt=ansn;i<=n && cnt;i++) if(a[i].b<=ansk)
		{
			vis[i]=1;
			ans.push_back(a[i].i);
			now+=a[i].a;
			cnt--;
		}
		for(int i=1;i<=n;i++) if( !vis[i] && a[i].a+now <= T )
		{
			ans.push_back(a[i].i);
			now+=a[i].a;
		}
		cout<<ans.size()<<'\n';
		if(ans.size()>0)
		{
			for(int i=0,sz=(int)ans.size();i<sz;i++)
				cout<<ans[i]<<" \n"[i+1==sz];
		}
	}
	
	return 0;
}