//  _____   _   _____    _____   _____   _      __    __
// |  ___| | | |  _  \  | ____| |  ___| | |     \ \  / /
// | |__   | | | |_| |  | |__   | |__   | |      \ \/ /
// |  __|  | | |  _  /  |  __|  |  __|  | |       \  /
// | |     | | | | \ \  | |___  | |     | |___    / /
// |_|     |_| |_|  \_\ |_____| |_|     |_____|  /_/
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lowbit(i) ((i) & -(i))
#define ull unsigned long long
#define int long long
// #define i64 long long
#define endl '\n'
using namespace std;
const int mod = 998244353;
const int N = 2e5 + 10;

void solve()
{
    int n, now;
    cin >> n >> now;
    vector<int> ans;
    vector<array<int, 3>> a(n + 1);
    vector<array<int, 3>> b;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i][0] >> a[i][1];
        a[i][2] = i;
    }
    sort(a.begin() + 1, a.end());
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> q;
    int j = 1;
    int ak = 0;
    while (1)
    {
        while (j <= n && a[j][0] <= now)
        {
            q.push({a[j][1], a[j][0], a[j][2]});
            j++;
        }
        while (q.size() && q.top()[0] < now)
        {
            auto [r, l, id] = q.top();
            q.pop();
            b.push_back({r, l, id});
        }
        if (q.empty())
        {
            if (j != n + 1)
            {
                ak += a[j][0] - now;
                now = a[j][0];
                continue;
            }
            break;
        }
        auto [r, l, id] = q.top();
        q.pop();
        now = r;
        ak += r - l;
        ans.push_back(id);
    }
    sort(all(b), greater<array<int, 3>>());
    for (auto [r, l, id] : b)
    {
        ans.push_back(id);
        ak += r - l;
    }
    cout << ak << endl;
    for (auto i : ans)
        cout << i << ' ';
    cout << endl;
    return;
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int tt = 1;
    cin >> tt;
    while (tt--)
    {
        solve();
    }
    return 0;
}