#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=(1<<16)+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,C,x;
struct Node{int A,B,id;}A[N];
int nxt[N],pre[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&C);
	vector<pii> ans;ll sum=0;
	queue<int> q;
	auto Do=[&](int x,int y){
		swap(nxt[x],nxt[y]);swap(A[x].A,A[y].A);
		pre[nxt[x]]=x;pre[nxt[y]]=y;
		ans.emplace_back(A[x].id,A[y].id);sum+=abs(A[y].A-A[x].A)+C;
	};
	auto chk=[&](int x,int y){
		return A[y].B>=A[x].A&&A[y].A<=A[x].A;
	};
	unordered_map<int,int> f;
	for(i=1;i<=n;i++) scanf("%d%d",&A[i].A,&A[i].B),A[i].id=i;
	sort(A+1,A+n+1,[](Node x,Node y){return x.B<y.B;});
	for(i=1;i<=n;i++) f[A[i].B]=i;
	for(i=1;i<=n;i++) nxt[i]=f[A[i].A],pre[nxt[i]]=i;
	for(i=1;i<=n;i++) while(nxt[i]^i){
		int l=i,r=i;//cerr<<A[i].A<<' '<<A[i].B<<'\n';
		while(1){
			l=pre[l];r=nxt[r];
			if(chk(i,l)) {Do(i,l);break;}
			if(chk(i,r)) {Do(i,r);break;}
		}
	}
	printf("%lld %d\n",sum,ans.size());
	for(auto i:ans) printf("%d %d\n",i.fi,i.se);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}