#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;
	int ans = 0;
	vector <node> a(n + 1);
	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;
	}
	//cout << ans << "\n";
	sort(a.begin() + 1, a.end(), [&](node a, node b){
		return a.x < b.x;
	});
	multiset <int> R;
	R.insert(f);
	vector <int> nxt(n + 1);
	map <int, vector<int>> mp;
	for(int i = 1; i <= n; i++){
		R.insert(a[i].y);
		mp[a[i].y].push_back(a[i].id);
	}
	mp[f].push_back(0);
	/*for(int i = 1; i <= n; i++){
		auto [u, v, idx] = a[i];
		cout << i << ": " << u << " " << v << " " << idx << "\n";
	}
	cout << "\n";*/
	vector <node> unf;
	for(int i = 1; i <= n; i++){
		auto [u, v, idx] = a[i];
		R.erase(R.find(v));
		auto it = R.lower_bound(u);
		if(it == R.end()){
			auto it2 = prev(it);
			int t = *it2;
			ans += u - t;
			R.erase(R.find(t));
			nxt[mp[t].back()] = idx;
			mp[t].pop_back();
		}else{
			//cerr << i << "\n";
			unf.push_back(a[i]);
		}
		R.insert(v);
	}
	//cerr << unf.size() << " " << R.size() << "\n";
	sort(unf.begin(), unf.end(), [&](node a, node b){
		return a.y > b.y;
	});
	for(int i = 0; i + 1 < unf.size(); i++){
		auto [u, v, idx] = unf[i];
		nxt[idx] = unf[i + 1].id;
	}
	/*for(int i = 0; i <= n; i++){
		cout << nxt[i] << " \n"[ i == n ];
	} */
	set <int> unuse;
	for(int i = 1; i <= n; i++){
		unuse.insert(i);
	}
	for(int i = 0; i <= n; i++){
		if(nxt[i] != 0){
			unuse.erase(nxt[i]);
		}
	}
	cout << ans << "\n";
	int p = 0;
	for(int i = 0; i < n; i++){
		if(nxt[p] == 0){
			p = *unuse.begin();
			cout << p << " ";
			unuse.erase(unuse.begin());
		}else{
			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();
	}
}