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

using LL = long long;

constexpr int inf = 1E9 + 10;

struct T {
    int l, r, id;
    bool operator<(const T &p) const {
        return l < p.l;
    }
};

void solve() {
    int n, f;
    cin >> n >> f;

    vector<T> a(n + 1);
    int lm = inf, rm = -1;

    LL w = 0;
    for (int i = 1; i <= n; i++) {
        auto &[l, r, id] = a[i];
        cin >> l >> r;
        if (r > rm) {
            lm = l;
            rm = r;
        } else if (r == rm) {
            lm = min(lm, l);
        }
        id = i;
        w += r - l;
    }

    vector<int> is(n + 1);
    vector<int> ans;

    sort(a.begin() + 1, a.end());
    int l = 1, now = 1;
    while (now <= n and a[now].l <= f) ++now;
    // cerr << lm << " " << rm << "\n";

    while (f < lm) {
        // cerr << f << " \n";
        int g = -1, id = -1;
        while (l <= n and a[l].l <= f) {
            if (a[l].r > g) {
                g = a[l].r;
                id = a[l].id;
            }
            ++l;
        }
        if (g <= f) {
            is[a[now].id] = 1;
            ans.emplace_back(a[now].id);
            w += a[now].l - f;
            f = a[now].l;
            ++now;
        } else {
            f = g;
            ans.emplace_back(id);
            is[id] = 1;
        }
    }

    sort(a.begin() + 1, a.end(), [&](T &x, T &y) {
        return x.r > y.r;
    });

    for (int i = 1; i <= n; i++) {
        if (!is[a[i].id]) {
            ans.emplace_back(a[i].id);
        }
    }

    cout << w << "\n";
    for (int x : ans) {
        cout << x << " \n"[x == ans.back()];
    }

}

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

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

/*
2

4 2
3 6
1 3
2 7
5 6

2 5
2 4
6 8
*/