#include <bits/stdc++.h>
#include <vector>

// #define x first
// #define y second

using namespace std;

typedef double ld;
typedef unsigned long ul;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;

const int maxn = 2e6 + 50;
const ll inf = 0x3f3f3f3f3f3f;
const vector<pll> dxy = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};

ll n, f;

void solve() {
  cin >> n >> f;
  vector<pll> v;
  map<pll, vector<ll>> mp;
  for (ll i = 1; i <= n; i++) {
    ll l, r;
    cin >> l >> r;
    v.push_back({l, r});
    mp[{l, r}].push_back(i);
  }

  sort(v.begin(), v.end());

  vector<vector<ll>> q;
  multiset<pll, greater<>> st;

  for (ll i = 0; i < (ll)v.size(); i++) {
    auto [l, r] = v[i];
    if (q.empty()) {
      vector<ll> w;
      w.push_back(i);
      q.push_back(w);
      st.insert({r, q.size() - 1});
    } else {
      // 第一个大于等于
      auto d = lower_bound(
          st.begin(), st.end(), make_pair(l, 0), [&](pll p1, pll p2) {
            return tie(p1.first, p1.second) > tie(p2.first, p2.second);
          });
      if (d != st.end()) {
        st.erase(d);
        ll p = d->second;
        q[p].push_back(i);
        st.insert({r, p});
      } else {
        vector<ll> w;
        w.push_back(i);
        q.push_back(w);
        st.insert({r, q.size() - 1});
      }
    }
  }

  sort(q.begin(), q.end(), [&](vector<ll> &v1, vector<ll> &v2) {
    return v[v1.back()].second > v[v2.back()].second;
  });

  vector<ll> ans;

  bool flag = false;
  for (ll qi = 0; qi < (ll)q.size(); qi++) {
    auto vi = q[qi];
    for (ll i = 0; i < (ll)vi.size(); i++) {
      ll p = vi[i];
      if (v[p].first >= f &&
          (i == 0 || (i - 1 >= 0 && v[vi[i - 1]].second <= f))) {
        for (ll j = i; j < (ll)vi.size(); j++) {
          ans.push_back(vi[j]);
        }
        for (ll j = 0; j < i; j++) {
          ans.push_back(vi[j]);
        }
        flag = true;
        q.erase(q.begin() + qi);
        break;
      }
    }
    if (flag)
      break;
  }

  for (auto i : q) {
    for (auto j : i) {
      ans.push_back(j);
    }
  }

  ll tot = 0ll;
  for (ll i = 0; i < (ll)ans.size(); i++) {
    ll p = ans[i];
    if (i == 0) {
      tot = max(v[p].first - f, 0ll) + v[p].second - v[p].first;
    } else {
      tot += max(v[p].first - v[ans[i - 1]].second, 0ll) + v[p].second -
             v[p].first;
    }
  }
  cout << tot << '\n';
  for (auto i : ans) {
    cout << mp[v[i]].front() << ' ';
    mp[v[i]].erase(mp[v[i]].begin());
  }
  cout << '\n';
}

void init() {
  // init_primes();
}

int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  init();
  int _t = 1;
  cin >> _t;
  cin.get();
  while (_t--)
    solve();

  return 0;
}