#include <bits/stdc++.h>
#pragma GCC optimize(3)
#define int long long
#define llu unsigned long long
#define endl "\n"
#define inf 0x3f3f3f3f
#define debug cout << "****************" << endl
using namespace std;

typedef pair<int, int> PII;

const int N = 1e6 + 7;

struct node {
    int l, r, id;
};

void solve()
{
    int n, f;
    cin >> n >> f;
    int sta = f;
    vector<node> p(n + 7);
    vector<PII> suf(n + 7);
    vector<int> vis(n + 7);
    vector<int> ans;
    vector<int> pos;
    for (int i = 1; i <= n; i++)
        cin >> p[i].l >> p[i].r, p[i].id = i;
    sort(p.begin() + 1, p.begin() + 1 + n, [&](node x, node y) {
        return x.l < y.l;
    });
    int mx = 0, mxid = 0;
    for (int i = n; i >= 1; i--) {
        if (p[i].r > mx) {
            mx = p[i].r;
            mxid = i;
        }
        suf[i] = {mx, mxid};
    }
    int idx = 1;
    while (1) {
        while (idx + 1 <= n && p[idx + 1].l <= f)
            idx++;
        if (suf[idx].first > f) {
            ans.push_back(p[suf[idx].second].id);
            pos.push_back(suf[idx].second);
            f = suf[idx].first;
            vis[p[suf[idx].second].id] = 1;
        }
        else
            break;
    }
    for (int i = n; i >= 1; i--) {
        if (!vis[p[i].id])
            ans.push_back(p[i].id), pos.push_back(i);
    }
    int res = 0;
    for (auto i : pos) {
        res += p[i].r - p[i].l;
        if (sta < p[i].l)
            res += p[i].l - sta;
        sta = p[i].r;
    }
    cout << res << endl;
    for (auto i : ans) {
        cout << i << " ";
    }
    cout << endl;
}

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