#include <bits/stdc++.h>
using namespace std;
#define _                    \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define int long long
#define pre(i, a, b) for (int i = a; i <= b; i++)
const int N = 1e6 + 10;
struct node
{
    int l, r, id;
    bool operator<(node w)
    {
        if (r != w.r)
            return r > w.r;
        return l > w.l;
    }
} a[N];
int n, f;
void solve()
{
    cin >> n >> f;
    pre(i, 1, n)
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
    }
    sort(a + 1, a + 1 + n);
    int ans = 0;
    pre(i, 1, n)
    {
        ans += max(a[i].l - f, 0ll) + a[i].r - a[i].l;
        f = a[i].r;
        // cout << i << " " << ans << endl;
    }
    cout << ans << endl;
    pre(i, 1, n) cout << a[i].id << " ";
    cout << endl;
}
signed main()
{
    _;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}