/* 
	24 HZ E
*/
#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;
void solve() {
	int n, f;
	cin >> n >> f;
	multiset <PII> L;
	multiset <PII> R;
	vector <PII> a(n + 1);
	for(int i = 1; i <= n; i++){
		cin >> a[i].x >> a[i].y;
		L.insert({a[i].x, i});
	}
	int ans = 0;
	R.insert({f, -1});
	vector <int> perm;
	while(R.size() && L.size()){
		PII t = *R.rbegin();
		//cout << t.x << " " << t.y << "\n";
		if(t.y != -1) perm.push_back(t.y);
		auto it = L.lower_bound({t.x, 0});
		if(it == L.end()){
			R.erase(R.find(t));
			PII bg = *L.begin();
			R.insert({a[bg.y].y, bg.y});
			ans += a[bg.y].y - bg.x;
			L.erase(L.find(bg));
			continue;
		}else{
			PII to = *it;
			ans += to.x - t.x;
			ans += a[to.y].y - to.x;
			R.insert({a[to.y].y, to.y});
			L.erase(L.find(to));
		}
	}
	PII t = *R.rbegin();
	perm.push_back(t.y);
	cout << ans << "\n";
	for(auto p: perm) cout << p << " ";
	cout << "\n";
} 
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T = 1;
	cin >> T;
	while(T--) {
		solve();
	}
}