#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); }

struct node
{
    ll l, r, id;
};
bool cmp(node x, node y)
{
    return x.l < y.l;
}

void qfl_zzz()
{
    ll n, f, w = 0;
    cin >> n >> f;
    vv<node> a(2 * n + 1);
    for (ll i = 1; i <= n; ++i)
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
        w += a[i].r - a[i].l;
    }

    sort(a.begin() + 1, a.begin() + n + 1, cmp);
    a[0].r = f;
    for (ll i = 1; i <= n; ++i)
    {
        w += max(a[i].l - a[i - 1].r, 0ll);
        a[i + n] = a[i];
    }

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

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

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;
}