#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define mp make_pair
using namespace std;
int n,f;
long long res;
struct pp{
	int l,r,id;
	bool vis;
}a[100001];
bool operator<(pp x,pp y){
	return x.l==y.l?x.r<y.r:x.l<y.l;
}
bool cmp(pp x,pp y){
	if(x.vis!=y.vis)return x.vis<y.vis;
	return x.r>y.r;
}
int ans[100001],cnt;
priority_queue<pair<int,int> >w;
void upd(int lim){
	while(w.size()){
		int x=w.top().second;
		if(a[x].r<lim)w.pop();
		else break;
	}
}
void solve(){
	res=cnt=0;
	while(w.size())w.pop();
	int i,mx=0;
	scanf("%d%d",&n,&f);
	for(i=1;i<=n;i++){
		scanf("%d%d",&a[i].l,&a[i].r);
		a[i].id=i;
		a[i].vis=0;
		res+=a[i].r-a[i].l;
		if(a[i].r>mx)mx=a[i].r;
	}
	sort(a+1,a+n+1);
	int l=0;
	while(f!=mx){
		while(l<n&&a[l+1].l<=f)l++,w.push(mp(-a[l].r,l));
		upd(f);
		if(!w.size()){
			l++;
			res+=a[l].l-f;
			f=a[l].r;
			ans[++cnt]=a[l].id;
			a[l].vis=1;
			continue;
		}
		int g=w.top().second;
		w.pop();
		ans[++cnt]=a[g].id;
		a[g].vis=1;
		f=a[g].r;
	}
	printf("%lld\n",res);
	sort(a+1,a+n+1,cmp);
	for(i=1;i<=n&&!a[i].vis;i++)ans[++cnt]=a[i].id;
	for(i=1;i<=n;i++)printf("%d ",ans[i]);
	printf("\n");
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--)solve();
}