#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define endl "\n"
#define double long double

const int N = 3e5 + 10;
const ll INF = 0x3f3f3f3f3f3f3f;

ll n, m, k;
struct node
{
  ll l,r;
  int ind;
  bool operator< (const node &a)const{
    if(l==a.l)return  r>a.r;
    return l>a.l;
  }
};

void solve()
{
  ll f;
  cin>>n>>f;
  int l=1,r=n;
  vector<ll>ans(n+5,0);
  vector<pll>llr(n+5);
  priority_queue<node>pq;
  ll total=0;
  for(int i=1;i<=n;i++){
    ll l,r;cin>>l>>r;
    node tt={l,r,i};
    pq.push(tt);
    llr[i]={l,r};
  }
  ll cur=f;
  while(pq.size()>1){
    auto t1=pq.top();
    pq.pop();
    auto t2=pq.top();
    if(t1.l>=cur){
      cur=t1.r;
      ans[l++]=t1.ind;
      continue;
    }
    if(t1.r>=t2.l)
    {
      ans[l++]=t1.ind;
      cur=t1.r;
    }
    else{
      ans[r--]=t1.ind;
      cur=t1.r;
    }
  }
  auto tt=pq.top();
  ans[l]=tt.ind;
  llr[0].second=f;
  for(int i=1;i<=n;i++){
    total+=llr[ans[i]].second-llr[ans[i]].first+max(0ll,llr[ans[i]].first-llr[ans[i-1]].second);
  }
  cout<<total<<endl;
  for(int i=1;i<=n;i++){
    cout<<ans[i]<<' ';
  }
  cout<<endl;
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int _ = 1;
  cin >> _;
  while (_--)
    solve();
  return 0;
}