#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve()
{
    int n, f;
    cin >> n >> f;
    multiset<array<int, 3>> se;
    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        se.insert({l, r, i});
    }

    vector<int> ans;
    multiset<array<int, 3>> tt;
    int tot = 0;
    while (ans.size() != n)
    {
        bool ok = false;
        for (auto [l, r, i] : se)
        {
            if (l <= f && r >= f)
            {
                ok = true;
                tot += r - l;
                f = r;
                ans.push_back(i);
                se.erase(se.find({l, r, i}));
                break;
            }
        }

        if (!ok)
        {
            auto t = se.lower_bound({f, 0, 0});
            if (t == se.end())
            {
                for (auto [l, r, i] : se)
                {
                    tt.insert({r, l, i});
                }
                break;
            }
            else
            {
                auto [l, r, i] = *t;
                tot += r - f;
                f = r;
                ans.push_back(i);
                se.erase({se.find({l, r, i})});
                vector<array<int, 3>> temp;
                for (auto [l, r, i] : se)
                {
                    if (r <= f)
                    {
                        tt.insert({r, l, i});
                        temp.push_back({l, r, i});
                    }
                }

                for (auto it : temp)
                {
                    se.erase(se.find(it));
                }
            }
        }
        else
        {
            vector<array<int, 3>> temp;
            for (auto [l, r, i] : se)
            {
                if (r <= f)
                {
                    tt.insert({r, l, i});
                    temp.push_back({l, r, i});
                }
            }

            for (auto it : temp)
            {
                se.erase(se.find(it));
            }
        }
    }
    while (ans.size() != n)
    {
        for (auto [r, l, i] : tt)
        {
            tot += r - l;
            ans.push_back(i);
        }
    }
    cout << tot << '\n';
    for (auto x : ans)
    {
        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;
}