#include <bits/stdc++.h>
using namespace std;
#define vv vector
#define ll long long
const int N = 200000 + 5;
const int P = 1e9 + 7;
const ll inf = 1e18;

mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<ll> rd(0, 1e9);
inline ll rnd() { return rd(gen); }

ll n, f;
struct node
{
    ll l, r, id;
};
bool cmp(node x, node y)
{
    return max(0ll, x.l - f) + max(0ll, y.l - x.r) < max(0ll, y.l - f) + max(0ll, x.l - y.r);
}

void qfl_zzz()
{
    cin >> n >> f;
    vv<node> a(n + 1);
    for (ll i = 1; i <= n; ++i)
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
    }
    sort(a.begin() + 1, a.end(), cmp);

    a[0].r = f;
    ll ans = 0;
    for (ll i = 1; i <= n; ++i)
        ans += max(0ll, a[i].l - a[i - 1].r) + a[i].r - a[i].l;

    cout << ans << "\n";
    for (ll i = 1; i <= n; ++i)
        cout << a[i].id << " \n"[i == n];
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    srand(unsigned(time(0)));
    cout << setiosflags(ios::fixed) << setprecision(12);

#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("std.txt", "w", stdout);
#endif

    int T = 1;
    cin >> T;
    while (T--)
        qfl_zzz();

    return 0;
}