#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const ll N = 2e5 + 5;
const ll P = 998244353;
ll n, m, f;
struct node {
    int l, r;
    int id;
} st[N];
bool cmp(node a, node b) {
    if (a.l == b.l) {
        return a.r < b.r;
    }
    return a.l < b.l;
}
bool cmp1(node a, node b) {
    return a.r > b.r;
}
void solve() {
    cin >> n >> f;
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        cin >> st[i].l >> st[i].r;
        ans += (st[i].r - st[i].l);
        st[i].id = i;
    }
    vector<int> v(n + 2), ve;

    sort(st + 1, st + 1 + n, cmp);
    int now = f, j = n + 1;
    for (int i = 1; i <= n; i++) {
        if (now < st[i].r) {
            if (now >= st[i].l) {
            } else {
                ans += st[i].l - now;
            }
            now = st[i].r;
            v[st[i].id] = 1;
            ve.push_back(st[i].id);
        }
    }
    sort(st + 1, st + n, cmp1);
    for (int i = 1; i <= n; i++) {
        if (!v[st[i].id]) {
            ve.push_back(st[i].id);
            st[i].id = 1;
        }
    }
    cout << ans << '\n';
    for (auto x : ve) {
        cout << x << ' ';
    }
    cout << '\n';
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}