#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 10;
int n, f;
struct info
{
    int l, r;
    int id;
} a[maxn], ss[maxn];
bool cmp(info &a, info &b)
{
    if (a.l != b.l)
        return a.l < b.l;
    else
        return a.r < b.r;
}
void solve()
{
    cin >> n >> f;
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
        ss[i].l = a[i].l;
        ss[i].r = a[i].r;
    }
    sort(a + 1, a + 1 + n, cmp);
    vector<info> res;
    info temp = a[1];
    vector<vector<int>> idx(n);
    int j = 0;
    idx[j].push_back(a[1].id);
    for (int i = 2; i <= n; i++)
    {
        if (temp.r >= a[i].l)
        {
            temp.r = max(temp.r, a[i].r);
            idx[j].push_back(a[i].id);
        }
        else
        {
            res.push_back(temp);
            j++;
            temp = a[i];
            idx[j].push_back(a[i].id);
        }
    }
    res.push_back(temp);
    vector<int> anspos;
    vector<int> vis(n + 1);
    for (int i = 0; i < res.size(); i++)
    {
        if (res[i].l >= f || (res[i].l <= f && res[i].r >= f))
        {
            for (int j = i; j < res.size(); j++)
            {
                vector<int> tep;
                for (auto p : idx[j])
                {
                    anspos.push_back(p);
                    tep.push_back(p);
                    vis[p] = 1;
                    if (ss[p].r == res[i].r)
                    {
                        break;
                    }
                }
            }
            for (int j = res.size() - 1; j >= 0; j--)
            {
                vector<int> tep;
                for (auto p : idx[j])
                {
                    if (!vis[p])
                        tep.push_back(p);
                    // anspos.push_back(p);
                }
                sort(tep.begin(), tep.end(), [](int i, int j)
                     { return ss[i].r > ss[j].r; });
                for (auto p : tep)
                {
                    anspos.push_back(p);
                }
            }
            break;
        }
    }
    if (anspos.empty())
    {
        for (int i = res.size() - 1; i >= 0; i--)
        {
            for (auto p : idx[i])
            {
                anspos.push_back(p);
            }
        }
    }
    for (int i = 0; i < anspos.size(); i++)
    {
        int p = anspos[i];
        if (i == 0)
        {
            ans += max(ss[p].l - f, 0ll);
            ans += ss[p].r - ss[p].l;
        }
        else
        {
            int pp = anspos[i - 1];
            ans += max(ss[p].l - ss[pp].r, 0ll);
            ans += ss[p].r - ss[p].l;
        }
    }
    cout << ans << '\n';
    for (auto &x : anspos)
    {
        cout << x << ' ';
    }
    cout << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}