#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define db double
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define sky fflush(stdout)
#define gc getchar
#define pc putchar
namespace IO{
	template<class T>
	inline void read(T &s){
		s = 0;char ch = gc();bool f = 0;
		while(ch < '0' || '9'<ch) {if(ch == '-') f = 1; ch = gc();}
		while('0'<=ch && ch<='9') {s = s * 10 + (ch ^ 48); ch = gc();}
		if(ch == '.'){
			T p = 0.1;ch = gc();
			while('0' <= ch && ch <= '9') {s = s + p * (ch ^ 48);p /= 10;ch = gc();}
		}
		s = f ? -s : s;
	}
	template<class T,class ...A>
	inline void read(T &s,A &...a){
		read(s); read(a...);
	}
	template<class T>
	inline void print(T x){
		if(x<0) {x = -x; pc('-');}
		static char st[40];
		static int top;
		top = 0;
		do{st[++top] = x - x / 10 * 10 + '0';} while(x /= 10);
		while(top) {pc(st[top--]);}
	}
	template<class T,class ...A>
	inline void print(T s,A ...a){
		print(s); print(a...);
	}
};
using IO::read;
using IO::print;
const int N = 1e5;
int n, x;
struct node{
	int l, r, id;
	friend bool operator < (const node &x, const node &y){
		return x.r > y.r;
	}
}p[N + 3];
std::set<node>s;
std::vector<int>ans;
bool vis[N + 3];
inline void solve(){
	read(n, x);
	int mx = 0;
	ll sum = 0;
	s.clear();
	ans.clear();
	for(int i = 1; i <= n; ++i){
		read(p[i].l, p[i].r);
		p[i].id = i;
		vis[i] = 0;
		mx = std::max(mx, p[i].r);
		sum += p[i].r - p[i].l;
	}
	std::sort(p + 1, p + 1 + n,[](const node &x, const node &y){
		return x.l < y.l;
	});
	int top = 1;
	while(x < mx){
		while(top <= n && p[top].l <= x){
			s.insert(p[top++]);
		}
		if(s.begin()->r > x){
			x = s.begin()->r;
			ans.push_back(s.begin()->id);
			vis[s.begin()->id] = 1;
		}else{
			s.clear();
			int l = top + 1, r = n, res = n;
			while(l <= r){
				int mid = l + r >> 1;
				if(p[mid].r > x){
					r = mid - 1; res = mid;
				}else l = mid + 1;
			}
			sum += p[res].l - x;
			x = p[res].r;
			ans.push_back(p[res].id);
			vis[p[res].id] = 1;
		}
	}
	std::sort(p + 1, p + 1 + n,[](const node &x, const node &y){
		return x.r > y.r;
	});
	for(int i = 1; i <= n; ++i){
		if(vis[p[i].id]) continue;
		ans.push_back(p[i].id);
	}
	printf("%lld\n", sum);
	for(auto it : ans){
		printf("%d ", it);
	}pc('\n');
}
int main(){
#ifdef LOCAL
	file(a);
#endif
	int T; read(T);
	while(T--){
		solve();
	}
	return 0;
}