#include <bits/stdc++.h>
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
using namespace std;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tp;
const int mod = 998244353;
const int inf = 1e16 + 10;
const int N = 1e6 + 10;

int n, p;
void solve()
{
    cin >> n >> p;
    vector<pii> v(n + 1);
    multiset<int> sl, sr;
    map<int, set<pii>> mpr, mpl;
    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        v[i] = {l, r};
        sl.insert(l);
        sr.insert(r);
        mpr[r].insert({l, i});
        mpl[l].insert({r, i});
    }
    int now = p;
    vector<int> op;
    while (op.size() < n)
    {
        if (*sl.begin() <= now)
        {
            auto it = prev(sr.end());
            int g = *it;
            auto itp = mpr[g].begin();
            auto [x, y] = *itp;
            op.push_back(y);
            mpr[g].erase(itp);
            mpl[x].erase({g, y});
            sr.erase(it);
            sl.erase(sl.find(x));
            now = g;
            continue;
        }
        auto it = sl.begin();
        int g = *it;
        auto itp = mpl[g].end();
        itp = prev(itp);
        auto [x, y] = *itp;
        op.push_back(y);
        mpl[g].erase(itp);
        mpr[x].erase({g, y});
        sl.erase(it);
        sr.erase(sr.find(x));
        now = x;
    }
    int res = 0;
    now = p;
    for (auto i : op)
    {
        auto [x, y] = v[i];
        res += max(x - now, 0LL);
        res += max(y - x, 0LL);
        now = y;
    }
    cout << res << endl;
    for (auto i : op)
        cout << i << ' ';
    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}