#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;
};
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;
    map<ll, vv<ll>> mp;
    for (ll i = 1; i <= n; ++i)
        mp[a[i].l].push_back(i);

    a[0].r = f;
    vv<ll> id = {0};
    for (ll i = 1; i <= n; ++i)
    {
        ll pre = a[id.back()].r;
        auto p = mp.upper_bound(pre);
        auto q = p;
        if (q != mp.begin())
            q = prev(q);
        if (p == mp.end() || abs((*q).first - pre) < abs((*p).first - pre))
            p = q;
        id.push_back((*p).second.back());
        (*p).second.pop_back();
        if ((*p).second.size() == 0)
            mp.erase(p);
    }

    ll ans = 0;
    for (ll i = 1; i <= n; ++i)
        ans += max(0ll, a[id[i]].l - a[id[i - 1]].r) + a[id[i]].r - a[id[i]].l;
    cout << ans << "\n";
    for (ll i = 1; i <= n; ++i)
        cout << id[i] << " \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;
}