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

using namespace std;

void solve()
{
    int n, f;
    cin >> n >> f;
    multiset<array<int, 3>> se1;
    multiset<array<int, 3>> se2;
    multiset<array<int, 3>> se3;

    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        if (l <= f && r >= f)
        {
            se2.insert({r, l, i});
        }
        else if (r < f)
        {
            se3.insert({r, l, i});
        }
        else
        {
            se1.insert({r, l, i});
        }
    }

    vector<int> ans;
    int tot = 0;
    while (ans.size() != n)
    {
        if (se2.empty())
        {
            if (se1.size())
            {
                auto val = (*se1.rbegin())[0];
                auto t = se1.lower_bound({val, 0, 0});
                auto [r, l, pos] = *t;
                tot += r - f; 
                ans.push_back(pos);
                se1.erase(t);
                for (auto it = se1.rbegin(); it != se1.rend(); it++)
                {
                    auto [r, l, pos] = *it;
                    ans.push_back(pos);
                    tot += r - l;
                }
            }

            if (se3.size())
            {
                for (auto it = se3.rbegin(); it != se3.rend(); it++)
                {
                    auto [r, l, pos] = *it;
                    ans.push_back(pos);
                    tot += r - l;
                }
            }
            break;
        }   
        auto it = se2.rbegin();
        auto [r, l, pos] = *it;
        tot += r - l;
        ans.push_back(pos);
        f = r;
        se2.erase(--se2.end());
        for(auto it:se2){
            se3.insert(it);
        }
        se2.clear();


        for (auto it = se1.begin(); it != se1.end();)
        {
            auto nxt = it;
            nxt++;
            auto [r, l, pos] = *it;
            if (l > f)
            {
                it++;
                continue;
            }
            else if (r <= f)
            {
                se3.insert(*it);
                se1.erase(it);
                it = nxt;
            }
            else
            {
                se2.insert(*it);
                se1.erase(it);
                it = nxt;
            }
        }
    }
    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;
}