/**/
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair<int, int> PII;
const int N = 1e7 + 10, M = 5010, mod = 998244353;
const int inf = 1e9;
struct node{
	int x, y, id;
};
void solve() {
	int n, f;
	cin >> n >> f;
	vector <node> a(n + 1);
	int ans = 0;
	for(int i = 1; i <= n; i++){
		cin >> a[i].x >> a[i].y;
		a[i].id = i;
		ans += a[i].y - a[i].x;
	}
	set <int> unuse;
	for(int i = 1; i <= n; i++) unuse.insert(i);
	sort(a.begin() + 1, a.end(), [&](node a, node b){
		return a.x < b.x;
	});
	int mx = f;
	vector <int> nxt(n + 1);
	vector <node> unf;
	map <int,vector<int>> mp;
	mp[f].push_back(0);
	for(int i = 1; i <= n; i++){
		auto [l, r, idx] = a[i];
		if(l > mx){
			ans += l - mx;
			nxt[mp[mx].back()] = idx;
			if(mp[mx].back() != 0) unuse.erase(mp[mx].back()); 
			mp[mx].pop_back();
		}else if(r > mx){
			nxt[mp[mx].back()] = idx;
			unuse.erase(mp[mx].back());
			mp[mx].pop_back();
		}
		mx = max(mx, r);
		mp[r].push_back(idx);
	}
	for(auto u: unuse) unf.push_back(a[u]);
	sort(unf.begin(), unf.end(), [&](node a, node b){
		return a.y > b.y;
	});
	if(nxt[mp[mx].back()] == 0) nxt[mp[mx].back()] = unf[0].id;
	for(int i = 0; i + 1 < unf.size(); i++){
		//cout << unf[i].id << " ";
		nxt[unf[i].id] = unf[i + 1].id;
		unuse.erase(unf[i].id);
 	}
 	//cout << unf[unf.size() - 1].id << "\n";
 	/*for(int i = 0; i <= n; i++){
 		cout << nxt[i] << " \n"[ i == n ];
	}*/
 	cout << ans << "\n";
 	int p = 0;
 	for(int i = 0; i < n; i++){
 		if(nxt[p] != 0){
 			cout << nxt[p] << " ";
 			p = nxt[p];
		}
	}
	cout << "\n";
} 
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T = 1;
	cin >> T;
	while(T--) {
		solve();
	}
}