#include <bits/stdc++.h>
using namespace std;
#define _                    \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define int long long
#define pre(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i >= b; i--)
const int N = 1e6 + 10;
#define pii pair<int, int>
struct node
{
    int l, r, id;
    bool operator<(node w)
    {
        if (l != w.l)
            return l < w.l;
        return r < w.r;
    }
} a[N];
int n, f;
void solve()
{
    cin >> n >> f;
    int ans = 0;
    pre(i, 1, n)
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
        ans += a[i].r - a[i].l;
    }
    sort(a + 1, a + 1 + n);
    vector<pii> ve;
    int l = a[1].l, r = a[1].r;
    pre(i, 2, n)
    {
        if (r < a[i].l)
        {
            ve.push_back({l, r});
            l = a[i].l, r = a[i].r;
        }
        else
            r = max(r, a[i].r);
    }
    ve.push_back({l, r});
    int pos = 0;
    for (int i = 0; i < ve.size(); i++)
    {
        if (ve[i].first >= f)
        {
            pos = i;
            break;
        }
    }
    // cout << pos << endl;
    // cout << ans << endl;
    vector<int> res;
    pre(i, 1, n)
    {
        if (a[i].l >= f)
            res.push_back(a[i].id);
    }
    rep(i, n, 1)
    {
        if (a[i].l < f)
            res.push_back(a[i].id);
    }
    ans += max(0ll, ve[pos].first - f);
    for (int i = pos + 1; i < ve.size(); i++)
        ans += ve[i].first - ve[i - 1].second;
    cout << ans << endl;
    for (auto L : res)
        cout << L << " ";

    cout << endl;
}
signed main()
{
    _;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}