#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define endl '\n'
#define MAXN 200005
struct node {
	ll l, r, id;
} a[MAXN];
struct cmp{
	bool operator()(node x,node y){
		return x.r<y.r;
	}
};
ll n, f;
ll st[MAXN];
bool cmp1(node x, node y) 
{
	if (x.l != y.l) {
		return x.l < y.l;
	}
	
	return x.r > y.r;
}
bool cmp2(node x, node y)
{
	if (x.r != y.r) {
		return x.r > y.r;
	}
	
	return x.l < y.l;
}
ll fun(ll x){
	ll l=1,r=n,ans=1e12;
	while(l<=r){
		ll mid=(l+r)>>1;
		if(a[mid].l>=x) ans=min(ans,mid),r=mid-1;
		else l=mid+1;
	}
	return ans;
}
ll fun1(ll x){
	ll l=1,r=n,ans=0;
	while(l<=r){
		ll mid=(l+r)>>1;
		if(a[mid].l<=x) ans=max(ans,mid),l=mid+1;
		else r=mid-1;
	}
	return ans;	
}
void solve()
{
	cin >> n >> f;
	
	priority_queue<node,vector<node>,cmp>q;
	ll res = 0;
	for (int i = 1; i <= n; i++) {
		ll l, r;
		cin >> l >> r;
		res += r - l;
		a[i].l = l;
		a[i].r = r;
		a[i].id = i;
		
		if (l <= f) {
			q.push({l,r,i});
		}
		st[i] = 0;
	}
	
	sort(a + 1, a + n + 1, cmp2);
	ll t = a[1].l,id=a[1].id;
//	cout<<t<<"  www "<<endl;
	sort(a+1,a+n+1,cmp1);
	vector<ll> ans;
	while (f < t) {
	// cout<<q.top().r<<endl;
		if (q.top().r <= f) {
			ll k = fun(f);
			res += a[k].l - f;
			ans.push_back(a[k].id);
			st[a[k].id] = 1;
			ll k1=fun1(a[k].r);
			for (int i = k + 1; i <= k1; i++) {
				q.push({a[i].l, a[i].r,a[i].id});
			}
			f = a[k].r;
		} else {
			ans.push_back(q.top().id);
			st[q.top().id]=1;
			ll k1=fun1(q.top().r);
			ll tmp=q.top().r;
			for (int i = k1; i >=1 ; i--) {
				if(a[i].l<f) break;
				q.push({a[i].l, a[i].r,a[i].id});				
			}
			f=tmp;
		}
	}
	if(!st[id]){
		ans.push_back(a[1].id);
		st[a[1].id]=1;
	}
	
	sort(a + 1, a + n + 1, cmp2);
	
	for (int i = 1; i <= n; i++) {
		if (st[a[i].id]) {
			continue;
		}
		
		ans.push_back(a[i].id);
	}
	
	cout << res << endl;
	
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i] << ' ';
	}
	cout << endl;
	
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1;
	cin >> t;
	
	while (t--) {
		solve();
	}
	
	return 0;
}
/*
2
4 2
3 6
1 3
2 7
5 6
2 5
2 4
6 8
 */
/*
13 2
1 4
2 3
5 13
6 7
8 16
9 18
10 14
11 12
15 20
17 19
21 25
22 25
23 24
 */