#include<bits/stdc++.h> 
#define ull unsigned long long
#define lch(x) t[x].s[0] 
#define rch(x) t[x].s[1]
#define INF 0x3f3f3f3f
#define ll long long 
#define lll __int128
#define re register
#define inl inline
#define N 1000050
#define rx x<<1|1
#define lx x<<1
using namespace std;

inline int read(){
	int w = 1 ,s = 0;
	char ch = getchar();
	while(!isdigit(ch)){
		if(ch=='-') w = -1;
		ch = getchar();
	}
	while(isdigit(ch)){
		s = (s<<3)+(s<<1)+ch-'0';
		ch = getchar();		
	}
	return w*s;
}

struct sp{
	int l ,r ,id ;
	bool operator<(const sp&a) const{
		return l < a.l ;
	}
} ;

void solve(){
	int n ,F ,p ;
	cin >> n >> F ;
	p = F ;
	ll ans = 0 ;
	std::vector<sp> t(n+1) ;
	std::vector<int> anx ;
	for(int i = 1;i <= n;i ++ ){
		cin >> t[i].l >> t[i].r ;
		t[i].id = i ;
	}

	sort(t.begin()+1,t.end()) ;
	int r = n + 1 ;
	for(int i = 1;i <= n;i ++ ){
		if(t[i].r >= p){
			ans += max(t[i].l-F,0) ;
			F = max(t[i].r,F) ;
			ans += t[i].r - t[i].l ;
			anx.push_back(t[i].id) ;
			r = min(i,r) ;
		}
	}

	for(int i = r - 1;i >= 1;i -- ){
		anx.push_back(t[i].id) ;
		ans += t[i].r - t[i].l ;
	}

	cout << ans << endl ;
	for(auto val : anx) cout << val << ' ' ;
	cout << endl ;
}

int main(){
	ios::sync_with_stdio(false);
	
	int t ;
	cin >> t ;
	while(t -- )
	solve() ;
}