#include<bits/stdc++.h>
#define int long long
using namespace std;


void solve() {
    int n, f;
    cin >> n >> f;
    int sum = 0;
    vector<tuple<int, int, int>> a;
    for (int i = 0, l, r; i < n; i++) {
        cin >> l >> r;
        a.emplace_back(l, r, i);
        sum += r - l;
    }
    sort(a.begin(), a.end());

    vector<int> ans;
    int lst = f;
    int N = n;
    for (int i = 0; i < n; i++) {
        auto [l, r, id] = a[i];
        if (r >= f) {
            N = i;
            for (int j = i; j < n; j++) {
                ans.push_back(get<2>(a[j]));
                sum += max(0ll, get<0>(a[j]) - lst);
                lst = get<1>(a[j]);
            }
            break;
        }
    }
    for (int i = N - 1; i >= 0; i--) {
        ans.push_back(get<2>(a[i]));
        sum += max(0ll, get<0>(a[i]) - lst);
        lst = get<1>(a[i]);
    }
    cout << sum << '\n';
    for (int x : ans) cout << x + 1 << ' ';
    cout << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T = 1;
    cin >> T;

    while (T--) {
        solve();
    }

    return 0;
}