#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define pb(a) push_back(a)
#define all(a) a.begin(), a.end()
const ll INF = (1LL << 60);

template <class T> struct BIT {
    int n;
    vector<T> a;
    BIT(int m) : n(m), a(m + 1, 0) {}
    void add(int x, T y) {
        x ++;
        while(x <= n) {
            a[x] += y;
            x += x & -x;
        }
    } 
    T sum(int x) {
        T r = 0;
        while(x > 0) {
            r += a[x];
            x -= x & -x;
        }
        return r;
    }
    T sum(int x, int y) {
        return sum(y) - sum(x);
    }
};


void solve() {
    ll n, f;
    cin >> n >> f;
    map<ll, ll> mp;
    int sz = 0;
    vector<ll> inv;
    vector<ll> le(n), ri(n);
    rep(i, n) {
        cin >> le[i] >> ri[i];
        mp[le[i]] ++;
        mp[ri[i]] ++;
    }
    mp[f] ++;
    for(auto [x, y] : mp) {
        inv.pb(x);
        mp[x] = sz ++;
    }
    BIT<ll> bit(sz);
    rep(i, n) {
        bit.add(mp[le[i]], 1);
        bit.add(mp[ri[i]], -1);
    }
    set<pair<ll, int>> st;
    rep(i, n) {
        st.insert({le[i], i});
    }
    ll ans = 0;
    int inf = 1 << 30;
    vector<ll> vec;
    while(!st.empty()) {
        if(!bit.sum(0, mp[f])) {
            auto itr = st.lower_bound({f, -inf});
            if(itr != st.end()) {
                auto [x, y] = *itr;
                ans += x - f;
                bit.add(mp[x], -1);
                bit.add(mp[ri[y]], 1);
                st.erase(itr);
                f = ri[y];
                ans += ri[y] - le[y];
                vec.pb(y + 1);
                continue;
            }
        }
        auto itr = st.upper_bound({f, inf});
        itr --;
        auto [x, y] = *itr;
        bit.add(mp[x], -1);
        bit.add(mp[ri[y]], 1);
        st.erase(itr);
        f = ri[y];
        ans += ri[y] - le[y];
        vec.pb(y + 1);
    }
    cout << ans << endl;
    for(ll e : vec) cout << e << " ";
    cout << endl;
}
int main() {
    int t;
    cin >> t;
    rep(i, t) solve();
}