#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
const int inf = 2e18;
int n, st;
struct node
{
    int first, second;
    int id;
};

bool cmp(const node &x, const node &y)
{
    return x.first < y.first;
}

void solves()
{
    cin >> n >> st;
    map<int, int> ma;
    map<int, int> mp;

    int mx = -inf;
    int sum = 0;

    vector<node> vis;
    for (int i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        sum += r - l;
        mx = max(mx, l);
        vis.push_back({l, r, i});
    }

    sort(vis.begin(), vis.end(), cmp);

    map<int, vector<int>> path;

    for (int i = 0; i < n; i++)
    {
        int l = vis[i].first, r = vis[i].second;
        int id = vis[i].id;
        if (mp[l])
        {
            ma[mp[l]] = r;
            mp[r] = mp[l];
            path[mp[l]].push_back(id);
            mp.erase(l);
            path[l].clear();
        }
        else
        {
            if (r > ma[l])
            {
                ma[l] = r;
                mp[r] = l;
                path[l].clear();
                path[l].push_back(id);
            }
        }
    }

    // for (auto item : ma)
    //     cout << item.first << ' ' << item.second << endl;

    int label = 0;
    for (auto item : ma)
    {
        if (item.first <= st and item.second >= mx)
        {
            cout << sum << endl;
            label = item.first;
            break;
        }
    }

    if (label)
    {
        map<int, int> flag;
        for (auto item : path[label])
        {
            cout << item << ' ';
            flag[item] = true;
        }
        for (int i = n - 1; i >= 0; i--)
        {
            int id = vis[i].id;
            if (flag[id])
                continue;
            cout << id << ' ';
        }
        cout << endl;
    }
    else
    {
        for (auto item : ma)
        {
            if (item.second >= mx)
            {
                cout << sum + abs(item.first - st) << endl;
                map<int, int> flag;
                for (int i = 0; i < path[item.first].size(); i++)
                {
                    cout << path[item.first][i] << ' ';
                    flag[path[item.first][i]] = true;
                }

                for (int i = n - 1; i >= 0; i--)
                {
                    int id = vis[i].id;
                    if (flag[id])
                        continue;
                    cout << id << ' ';
                }
                cout << endl;
            }
        }
    }
}

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