#include <bits/stdc++.h>
using namespace std;
#define _                    \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define int long long
#define pre(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i >= b; i--)
const int N = 1e6 + 10;
#define pii pair<int, int>
struct node
{
    int l, r, id;
    bool operator<(node w)
    {
        if (l != w.l)
            return l < w.l;
        return r < w.r;
    }
} a[N];
bool cmpp(node a, node b)
{
    if (a.r != b.r)
        return a.r < b.r;
    return a.l < b.l;
}
int n, f;
void solve()
{
    cin >> n >> f;
    int ans = 0;
    pre(i, 1, n)
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
        ans += a[i].r - a[i].l;
    }
    sort(a + 1, a + 1 + n);
    // ans += max(0ll, a[n].l - f);
    // cout << ans << endl;
    // rep(i, n, 1)
    //         cout
    //     << a[i].id << " ";
    // cout << endl;
    vector<pii> ve;
    vector<pair<int, int>> vv;
    int l = a[1].l, r = a[1].r;
    int now = 1;
    pre(i, 2, n)
    {
        if (r < a[i].l)
        {
            ve.push_back({l, r});
            vv.push_back({now, i - 1});
            now = i;
            l = a[i].l, r = a[i].r;
        }
        else
            r = max(r, a[i].r);
    }
    ve.push_back({l, r});
    vv.push_back({now, n});
    // cout << vv.size() << endl;
    // for (auto [aa, b] : vv)
    //     cout << aa << " " << b << endl;
    // return;
    int ok = 0;
    int ll = -1, rr = -1;
    for (auto [aa, b] : ve)
    {
        // cout << aa << " " << b << " " << f << endl;
        if (f > aa && f <= b)
        {
            ok = 1;
            break;
        }
    }

    // cout << ok << endl;
    // return;
    if (ok == 1)
    {
        int pos = -1;
        vector<int> res;
        for (int i = 0; i < ve.size(); i++)
        {
            if (ve[i].second >= f)
            {
                ll = ve[i].first;
                rr = ve[i].second;
                pos = i;
                break;
            }
        }
        for (auto [aa, b] : vv)
        {
            if (a[aa].l > ve[pos].first)
                break;
            // cout << aa << " " << b << endl;
            // cout << 132 << endl;
            sort(a + aa, a + b + 1, cmpp);
        }
        // cout << 132 << endl;
        // cout << 1 << endl;
        // return;
        // cout << ans << endl;
        // cout << pos << endl;
        for (int i = pos + 1; i < ve.size(); i++)
        {
            ans += ve[i].first - ve[i - 1].second;
            // cout << ve[i].first << " " << ve[i - 1].second << endl;
        }
        map<int, int> ma;
        for (int i = 1; i <= n; i++)
        {
            if (a[i].l >= ll && a[i].r <= rr)
            {
                res.push_back(a[i].id);
                ma[a[i].id]++;
            }
        }
        // cout << res.size() << endl;
        pre(i, 1, n)
        {
            if (a[i].l > f && !ma[a[i].id])
                res.push_back(a[i].id);
        }
        rep(i, n, 1)
        {
            if (a[i].r < f && !ma[a[i].id])
                res.push_back(a[i].id);
        }
        cout << ans << endl;
        for (auto L : res)
            cout << L << " ";
        cout << endl;
        return;
    }
    int pos = -1;
    for (int i = 0; i < ve.size(); i++)
    {
        if (ve[i].first >= f)
        {
            pos = i;
            break;
        }
    }
    for (auto [aa, b] : vv)
    {
        if (aa > pos)
            break;
        sort(a + aa, a + b + 1, cmpp);
    }
    // cout << pos << endl;
    // cout << ans << endl;
    // return;
    vector<int> res;
    pre(i, 1, n)
    {
        if (a[i].l >= f)
            res.push_back(a[i].id);
    }
    rep(i, n, 1)
    {
        if (a[i].l < f)
            res.push_back(a[i].id);
    }
    // cout << 1 << endl;
    // return;
    // cout << pos << endl;
    // return;
    if (pos == -1)
    {
        cout << ans << endl;
        for (auto L : res)
            cout << L << " ";
        cout << endl;
        return;
    }
    ans += max(0ll, ve[pos].first - f);
    for (int i = pos + 1; i < ve.size(); i++)
        ans += ve[i].first - ve[i - 1].second;
    cout << ans << endl;
    for (auto L : res)
        cout << L << " ";
    // cout << 1 << endl;
    // return;
    cout << endl;
}
signed main()
{
    _;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}