#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#include <omp.h>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;
typedef long double ld;

void rsolve() {
  int n, src;
  cin >> n >> src;
  vector<array<int, 3>> options(n);
  vector<array<int, 2>> orig(n);
  int maxh = 0;
  ll ret = 0;
  for(int i = 0; i < n; i++) {
    cin >> options[i][0] >> options[i][1];
    updmax(maxh, options[i][1]);
    options[i][2] = i+1;
    orig[i] = {options[i][0], options[i][1]};
  }
  priority_queue<array<int, 2>> q; // <endh, idx>
  int optidx = 0;
  sort(all(options));
  vector<int> retv;
  while(src < maxh) {
    while(optidx < n && options[optidx][0] <= src) {
      q.push({options[optidx][1], options[optidx][2]});
      optidx++;
    }
    if(sz(q) && q.top()[0] > src) {
      retv.pb(q.top()[1]); q.pop();
      int tidx = retv.back()-1;
      ret += orig[tidx][1] - orig[tidx][0];
    }
    else {
      assert(optidx < n);
      retv.pb(options[optidx][2]);
      int tidx = retv.back()-1;
      ret += orig[tidx][1] - src;
      optidx++;
    }
    src = orig[retv.back()-1][1];
  }
  while(optidx < n) {
    q.push({options[optidx][1], options[optidx][2]});
    optidx++;
  }
  while(sz(q)) {
    retv.pb(q.top()[1]);
    q.pop();
    int tidx = retv.back()-1;
    ret += orig[tidx][1] - orig[tidx][0];
  }
  cout << ret << "\n";
  for(int i = 0; i < sz(retv); i++) cout << retv[i] << " \n"[i == sz(retv)-1];
}

void solve() {
  int t;
  cin >> t;
  while(t--) rsolve();
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}