#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = double;
using ull = unsigned long long;

constexpr int N = 3e5 + 5;
const ll inf = 1e16;

template<class T>
T& cmax(T &a, const T &b) {if (a < b) a = b; return a;}

template<class T>
T& cmin(T &a, const T &b) {if (a > b) a = b; return a;}

void solve() {
    int n, f;
    cin >> n >> f;
    vector<int> L(n), R(n);
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        cin >> L[i] >> R[i];
        ans += R[i] - L[i];
    }
    vector<int> id(n);
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](int i, int j) {return L[i] < L[j];});
    vector<int> ans_id;
    priority_queue<pair<int, int> > heap;
    int now = f;
    for (int i = 0; i < n; ++i) {
        if (now <= R[id[i]]) {
            ans += max(L[id[i]] - now, 0);
            now = R[id[i]];
            ans_id.push_back(id[i]);
        } else {
            heap.push({R[id[i]], id[i]});
        }
    }
    while (heap.size()) {
        auto [d, i] = heap.top();
        heap.pop();
        ans_id.push_back(i);
    }
    cout << ans << "\n";
    for (int i = 0; i < n; ++i) {
        cout << ans_id[i] + 1 << " \n"[i + 1 == n];
    }
}

int main(void){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int t = 1;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		solve();
	}
	return 0;
}