#include <bits/stdc++.h>
using namespace std;

#define x first
#define y second
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 1e5 + 10;

template <class T, class F>
T max(T a, F b) {
  return a > b ? a : b;
}

template <class T, class F>
T min(T a, F b) {
  return a < b ? a : b;
}

struct Ta {
  int l,r,i;
  bool operator < (const Ta& o) {
      if(this->r == o.r) {
        return this->l < o.l;
      }
      return this->r < o.r;
  }
}ta[N];

int n, m, k;
bool cmp(const Ta&a, const Ta&b) {
  if(a.l == b.l) {
    return a.r > b.r;
  }
  return a.l < b.l;
}
void init() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}

void solve() {
  cin >> n >> k;
  int x,y;
  for(int i = 1; i <= n; i++) {
    cin >> x >> y;
    ta[i] = {x, y, i};
  }
  vector<int>ansV;
  vector<bool>st(n+1);
  ll ans = 0;
  sort(ta+1, ta+1+n);
  // 1. 找到可以上升的区间
  int mxi = 0;
  for(int i = 1; i <= n; i++) {
    if(ta[i].r >= k) {
      mxi = i;
      break;
    }
  }
  sort(ta+mxi,ta+n+1,cmp);
  // 2. 划分区块
  for(int i = mxi; i <= n; i++) {
    if(ta[i].l > k) {
      ans += ta[i].l - k;
    }
    k = ta[i].r;
  }
  
  sort(ta+1, ta+1+n);
  for(int i = 1; i <= n; i++) {
    ans += ta[i].r - ta[i].l;
  }
  cout << ans << endl;
  for(int i = mxi; i <= n; i++) {
    cout << ta[i].i << " ";
  }
  for(int i = mxi - 1; i >= 1; i--) {
    cout << ta[i].i << " ";
  }
  cout << endl;
}
int main() {
  init();
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}