#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
using namespace std;
#define ll long long
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define db double
#define baoliu(x, y) cout << fixed << setprecision(y) << x
#define endl "\n"
#define alls(x) (x).begin(), (x).end()
#define fs first
#define sec second
#define bug(x) cerr << #x << " = " << x << endl
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const double eps = 1e-8;
const double PI = acos(-1.0);
void solve() {
    int n, f;
    cin >> n >> f;
    vector<pii> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i].fs >> a[i].sec;
    // sort(alls(a), [](pii i, pii j) {
    //     return i.sec < j.sec;
    // });
    int ans = 0;
    int cur = f;
    multiset<array<int, 3>> st;
    for (int i = 1; i <= n; i++) st.insert({a[i].fs, a[i].sec, i});
    vector<int> p;
    vector<int> tmp;
    while (st.size()) {
        auto [l, r, id] = *st.begin();
        if (r <= cur) {
            ans += r - l;
            st.erase(st.begin());
            tmp.push_back(id);
        } else {
            if (l <= cur) {
                ans += r - l;
                st.erase(st.begin());
                cur = r;
                p.push_back(id);
            } else {
                ans += l - cur;
                cur = l;
            }
        }
        deb(l, r, id, ans);
    }
    for (auto x : tmp) p.push_back(x);
    cout << ans << endl;
    for (auto x : p) cout << x << " ";
    cout << endl;
}
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
#ifdef LOCAL
    double starttime = clock();
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
#endif
    int t = 1;
    cin >> t;
    while (t--) solve();
#ifdef LOCAL
    double endtime = clock();
    cerr << "Time Used: " << (double)(endtime - starttime) / CLOCKS_PER_SEC * 1000 << " ms" << endl;
#endif
    return 0;
}