#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5e4 + 10;
int n, k;
void solve()
{
    cin >> n >> k;
    vector<pair<pair<int, int>, int>> ve;
    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        ve.push_back({{l, r}, i});
    }
    sort(ve.begin(), ve.end());
    int ans = 0;
    vector<int> vis(n + 1, 0);
    vector<int> ans1;
    for (auto tmp : ve)
    {
        int l = tmp.first.first, r = tmp.first.second;
        if (l <= k)
        {
            if (r >= k)
            {
                k = r;
                vis[tmp.second] = 1;
                ans1.push_back(tmp.second);
            }
        }
    }
    vector<pair<pair<int, int>, int>> ve1;
    vector<pair<pair<int, int>, int>> vv;
    for (auto tmp : ve)
    {
        int l = tmp.first.first, r = tmp.first.second;
        if (l <= k)
        {
            if (vis[tmp.second] == 0)
                vv.push_back({{r, l}, tmp.second});
            ans += r - l;
        }
        else
            ve1.push_back({{l, r}, tmp.second});
    }
    int mx = 0;
    vector<pair<pair<int, int>, int>> ve2;
    for (auto tmp : ve1)
    {
        int l = tmp.first.first, r = tmp.first.second;
        if (r <= mx)
        {
            vv.push_back({{r, l}, tmp.second});
            ans += r - l;
        }
        else
            ve2.push_back({{l, r}, tmp.second});
        mx = max(mx, r);
    }
    // cerr << ans << "\n";
    int len = ve2.size();
    int lst = k;
    for (int i = 0; i < len; i++)
    {
        int l = ve2[i].first.first, r = ve2[i].first.second;
        ans1.push_back(ve2[i].second);
        // cerr << abs(l - lst) << " " << r - l << " " << lst << "\n";
        ans += abs(l - lst);
        ans += r - l;
        lst = r;
    }
    // cerr << ans << "\n";
    sort(vv.begin(), vv.end(), greater<pair<pair<int, int>, int>>());
    len = vv.size();
    for (int i = len - 1; i >= 0; i--)
        ans1.push_back(vv[i].second);
    cout << ans << "\n";
    for (auto x : ans1)
        cout << x << " ";
    cout << "\n";
}
void check()
{
    cin >> n >> k;
    vector<pair<int, int>> ve;
    int num = 0;
    for (int i = 0; i < n; i++)
    {
        int l, r;
        cin >> l >> r;
        ve.push_back({l, r});
        num += r - l;
    }
    int a[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    int mx = 1e9;
    vector<int> aa;
    do
    {
        int kk = k;
        int ans = 0;
        for (int i = 0; i < n; i++)
        {
            if (kk < ve[a[i]].first)
                ans += ve[a[i]].first - kk;
            kk = ve[a[i]].second;
        }
        if (ans < mx)
        {
            mx = ans;
            aa.clear();
            for (int i = 0; i < n; i++)
            {
                aa.push_back(a[i]);
            }
        }
    } while (next_permutation(a, a + n));

    cout << mx << "\n";
    for (auto x : aa)
        cout << x << " ";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        // check();

        solve();
    }

    return 0;
}