#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
void solve()
{
    ll n, f, ans = 0;
    cin >> n >> f;
    multiset<int> s;
    vector<array<int, 3>> seg(n);
    vector<int> path, vis(n + 1, 0);
    for (int i = 0; i < n; i++)
    {
        cin >> seg[i][0] >> seg[i][1];
        seg[i][2] = i;
    }
    sort(seg.begin(), seg.end(), [&](array<int, 3> u, array<int, 3> v)
         { return u[1] < v[1]; });

    int st = -1;
    for (int i = 0; i < n; i++)
        if (seg[i][0] <= f && f <= seg[i][1])
        {
            st = seg[i][2];
            break;
        }

    if (st == -1)
    {
        for (int i = 0; i < n; i++)
            if (f <= seg[i][1])
                s.insert(i);
        if (s.size())
        {
            st = *s.begin();
            s.erase(st);
            ans += seg[st][0] - f;
        }
    }
    else
    {
        for (int i = 0; i < n; i++)
            if (i != st && seg[st][1] <= seg[i][1])
                s.insert(seg[i][2]);
    }
    if (st != -1)
    {
        vis[st] = 1;
        path.push_back(st);
        ans += seg[st][1] - seg[st][0];
    }
    // cout << st << endl;
    while (s.size())
    {
        while (s.size() && seg[*s.begin()][1] < seg[st][1])
            s.erase(s.begin());
        if (s.size())
        {
            if (seg[*s.begin()][0] > seg[st][1])
                ans += seg[*s.begin()][0] - seg[st][1];
            st = *s.begin();
            vis[st] = 1;
            path.push_back(st);
            ans += seg[st][1] - seg[st][0];
            s.erase(st);
        }
    }

    vector<int> a;
    for (int i = 0; i < n; i++)
        if (!vis[i])
            a.push_back(i);
    sort(a.begin(), a.end(), [&](int u, int v)
         { return seg[u][0] > seg[v][0]; });

    for (auto &i : a)
    {
        path.push_back(i);
        ans += seg[i][1] - seg[i][0];
    }
    cout << ans << endl;
    for (auto &i : path)
        cout << i + 1 << " ";
    cout << endl;
}

int main()
{
#ifdef x3ea
    freopen("in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    for (; _; _--)
        solve();
    return 0;
}