#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 mod = 998244353;
#define endl '\n'

void solve()
{
    int n, f;
    cin >> n >> f;
    vector<array<int, 3>> a(n);
    int cnt = 0;
    for (auto &i : a)
        cin >> i[0] >> i[1], i[2] = ++cnt;
    sort(a.begin(), a.end(), [&](array<int,3> a, array<int, 3> b)
         { return a[0] < b[0]; });
    vector<bool> vis(n, 0);
    i64 ans = 0;
    vector<int> finals;
    for (int i = 0; i < n; i++)
    {
        if (a[i][0] >= f)
        {
            ans += (a[i][0] - f) + a[i][1] - a[i][0];
            f = a[i][1];
            vis[i] = 1;
            finals.push_back(a[i][2]);
        }
    }
    for (int i = n - 1; i >= 0; i--)
    {
        if (vis[i])
            continue;
        ans += a[i][1] - a[i][0];
        finals.push_back(a[i][2]);
    }
    cout << ans << endl;
    for (auto &i : finals)
        cout << i << " ";
    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}