#include<bits/stdc++.h>
#define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define cl(f,x) memset(f,x,sizeof(f))
using namespace std;
const int N=2e5+5;
struct SGT {
	struct node {
		int lson,rson,val,cnt;
	}; node tree[N<<2];
#define ls(k) tree[k].lson
#define rs(k) tree[k].rson
	int p;
	int new_node() {
		return ++p;
	}
	void init() {
		rep(i,1,p)
			tree[i]={0,0,0,0};
		p=0;
	}
	void push_up(int k) {
		tree[k].val=tree[ls(k)].val+tree[rs(k)].val;
		tree[k].cnt=tree[ls(k)].cnt+tree[rs(k)].cnt;
	}
	void update(int &k,int l,int r,int qx,int val) {
		if(!k)
			k=new_node();
		if(l==r) {
			tree[k].cnt+=val;
			tree[k].val+=val*l;
			return;
		}
		int mid=(l+r)>>1;
		if(qx<=mid)
			update(ls(k),l,mid,qx,val);
		else
			update(rs(k),mid+1,r,qx,val);
		push_up(k);
	}
	int query(int k,int l,int r,int rk) {
		if(l==r)
			return rk*l;
		int cnt=tree[ls(k)].cnt,val=tree[ls(k)].val;
		int mid=(l+r)>>1;
		if(cnt<rk)
			return val+query(rs(k),mid+1,r,rk-cnt);
		else
			return query(ls(k),l,mid,rk);
	}
}; SGT pre,suf;
int a[N],b[N],p[N],n,m;
PII t[N];
int check(int x) {
	pre.init(); suf.init();
	int prt=0,srt=0;
	rep(i,1,n) 
		suf.update(srt,1,1e9,a[i],1);
	rep(i,1,n) {
		suf.update(srt,1,1e9,a[i],-1);
		if(i>=x) {
			int k=max(b[i],x);
			if(n-i>=k-x) {
				if(pre.query(prt,1,1e9,x-1)+a[i]+suf.query(srt,1,1e9,k-x)<=m)
					return i;
			}
		}
		pre.update(prt,1,1e9,a[i],1);
	}
	return -1;
}
void print(int l,int r,int k) {
	vector<PII> vec;
	rep(i,l,r)
		vec.push_back({a[i],p[i]});
	sort(vec.begin(),vec.end());
	rep(i,0,k-1)
		printf("%lld ",vec[i].second);
}
signed main() {
	int T;
	scanf("%lld",&T);
	while(T--) {
		scanf("%lld%lld",&n,&m);
		rep(i,1,n)
			scanf("%lld%lld",&t[i].first,&t[i].second),p[i]=i;
		sort(p+1,p+n+1,[](const int &x,const int &y) {
			return t[x].second<t[y].second;
		});
		rep(i,1,n)
			a[i]=t[p[i]].first,b[i]=t[p[i]].second;
		int l=1,r=n,ans=0,pos=0;
		while(l<=r) {
			int mid=(l+r)>>1;
			int val=check(mid);
			if(val!=-1)
				ans=mid,pos=val,l=mid+1;
			else
				r=mid-1;
		}
		printf("%lld\n%lld\n",ans,max(ans,b[pos]));
		if(pos) {
			print(1,pos-1,ans-1);
			printf("%lld ",p[pos]);
			print(pos+1,n,max(ans,b[pos])-ans);
			puts("");
		}
	}
	return 0;
}