#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);
    for (int i = 0; i < n; ++i) {
        cin >> L[i] >> R[i];
    }
    vector<int> id(n);
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](int i, int j) {return R[i] < R[j];});
    ll ans = 0;
    vector<int> ans_id;
    for (int i = 0; i < n; ++i) {
        if (R[id[i]] > f) {
            int pre = f;
            for (int j = i; j < n; ++j) {
                ans += R[id[j]] - L[id[j]] + max(0, L[id[j]] - pre);
                ans_id.push_back(id[j]);
                pre = R[id[j]];
            }
            for (int j = 0; j < i; ++j) {
                ans += R[id[j]] - L[id[j]] + max(0, L[id[j]] - pre);
                ans_id.push_back(id[j]);
                pre = R[id[j]];
            }
            break;
        }
    }
    if (ans_id.size() == 0) {
        int pre = f;
        for (int j = 0; j < n; ++j) {
            ans += R[id[j]] - L[id[j]] + max(0, L[id[j]] - pre);
            ans_id.push_back(id[j]);
            pre = R[id[j]];
        }
    }
    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;
}