#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
#define int    long long 
typedef pair<int, int>pii;
typedef pair<char, int>pci;
typedef pair<pii, int>piii;
const int mod = 998244353;
const int N = 5e5 + 100;

void solve()
{
    vector<piii>a;
    vector<bool> st;
    int n, h; cin >> n >> h;
    for (int i = 1; i <= n; i++) {
        int t1, t2;
        cin >> t1 >> t2;
        a.push_back({ { t1,t2 }, i });
        st.push_back(false);
    }
    sort(a.begin(), a.end());

    int sum = 0;

    int start = -1;
    int now_h = h;
    for (int i = 0; i < n; i++) {
        if (a[i].first.second > now_h&&a[i].first.first<now_h)
        {
            now_h = max(now_h, a[i].first.second);
            start = i;
        }
    }
    if (start == -1)
    {
        for (int i = 0; i < n; i++) {
            if (a[i].first.first >=h)
            {
                sum += a[i].first.first - h;
                now_h = a[i].first.second;
                start = i;
                break;
            }
         
        }
        if (start == -1) {
            start = n;
        }
    }
  
    st[start] = true;
    for (int i = start + 1; i < n; i++) {
        if (a[i].first.second <= now_h) continue;
        sum += max(a[i].first.first - now_h, (int)0);
        now_h = a[i].first.second;

        st[i] = true;
    }

    for (auto t : a) {
        sum += t.first.second - t.first.first;
    }
    cout << sum << endl;

    for (int i = 0; i < n; i++) {
        if (st[i]) cout << a[i].second << ' ';
    }
    for (int i = n - 1; i >= 0; i--) {
        if (!st[i]) cout << a[i].second << ' ';
    }
    cout << endl;

}

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