#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e5+2e2;
using pll=pair<ll,ll>;
#define pb push_back
struct Floor{
	ll l,r,id;
}fl[N];
bool cmpl(Floor a,Floor b){
	return a.l<b.l;
}
bool cmpr(Floor a,Floor b){
	return a.r<b.r;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int tt;
	cin>>tt;
	while(tt--){
		ll n,f;
		cin>>n>>f;
		ll ans=0;
		for(ll i=1;i<=n;i++){
			ll l,r;
			cin>>l>>r;
			ans+=r-l;
			fl[i]={l,r,i};
		}
		vector<int>flag(n+10);
		vector<ll>p;
		sort(fl+1,fl+1+n,cmpl);
		priority_queue<pll,vector<pll>,greater<pll>>pq;
		for(ll i=1;i<=n;i++){
			if(fl[i].l<=f){
				pq.push({fl[i].r,fl[i].id});
			}
			else {
				if(pq.top().first>f){
					f=pq.top().first;
					ll id=pq.top().second;
					p.pb(id);flag[id]=1;
				}
				if(f<=fl[i].l){
					ans+=fl[i].l-f;
					f=fl[i].r;
					p.pb(fl[i].id);flag[fl[i].id]=1;
				}
				else {
					pq.push({fl[i].r,fl[i].id});
				}
				
			}
			
		}
		cout<<ans<<'\n';
		sort(fl+1,fl+1+n,cmpr);
		for(int i=n;i>=1;i--){
			ll id=fl[i].id;
			if(!flag[id])p.pb(id);
		}
		for(auto it:p)cout<<it<<' ';cout<<'\n';
		
		
		
	}
}