#include<bits/stdc++.h>
#define int long long
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=1e5+10;
int T,n,f,l[MAXN],r[MAXN],vis[MAXN],id[MAXN],res[MAXN];
signed main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--) {
		cin>>n>>f;
		ffor(i,1,n) cin>>l[i]>>r[i],id[i]=i,vis[i]=0;
		sort(id+1,id+n+1,[](int A,int B) {
			return l[A]<l[B];
		});
		int tot=0;
		ffor(i,1,n) if(l[id[i]]>=f) ++tot,res[tot]=id[i],vis[id[i]]=1;
		sort(id+1,id+n+1,[](int A,int B) {
			return r[A]>r[B];	
		});
		ffor(i,1,n) if(!vis[id[i]]) ++tot,res[tot]=id[i];
		r[0]=f;
		int ans=0;
		ffor(i,1,n) ans+=max(l[res[i]]-r[res[i-1]],0ll)+r[res[i]]-l[res[i]];
		cout<<ans<<'\n';
		ffor(i,1,n) cout<<res[i]<<' ';
		cout<<'\n';
	}
	return 0;
}