#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n, f;
  IN(n, f);
  vector<int> L(n), R(n);
  for (int i : Rep(0, n)) {
    IN(L[i], R[i]);
  }

  vector<int> order(ALL(Rep(0, n)));
  ranges::stable_sort(order, {}, LAMBDA(i, pair(R[i], -L[i])));
  basic_string<int> s;
  for (int i : order) {
    while (Sz(s) && L[s.back()] >= L[i]) {
      s.pop_back();
    }
    s += i;
  }

  vector<int> ans;
  ans.reserve(n);
  vector<bool> done(n);
  for (int i : s) {
    if (L[i] >= f) {
      ans.push_back(i);
      done[i] = true;
    }
  }
  order.clear();
  for (int i : Rep(0, n)) {
    if (done[i]) {
      continue;
    }
    order.push_back(i);
  }
  ranges::sort(order, {}, LAMBDA(i, L[i]));
  while (Sz(order)) {
    ans.push_back(order.back());
    order.pop_back();
  }

  int64_t mn = 0;
  int cur = f;
  for (int i : ans) {
    mn += max(L[i] - cur, 0);
    mn += R[i] - L[i];
    cur = R[i];
  }
  OUT(mn);
  OUT(ans | MAP(i, i + 1));
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  IN(t);
  while (t--) {
    Solve();
  }
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define LAMBDA(x, ...) ([&](auto&& x) -> decltype(auto) { return __VA_ARGS__; })
#define ALL(r) begin(r), end(r)
#define MAP(...) views::transform(LAMBDA(__VA_ARGS__))
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Sz(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1