#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int T,n,Y0,a[N],ca,mx,mn,pr[N],su[N];
vector<int>e[N];
struct po{
	int x,y;
}p[N];
set<int>S;
void solve(){
	scanf("%d%d",&n,&Y0);
	for(int i=1;i<=n;++i){
		scanf("%d%d",&p[i].x,&p[i].y);
		p[i].y=abs(p[i].y-Y0);
		a[i]=p[i].x;
	}
	sort(a+1,a+n+1);
	ca=unique(a+1,a+n+1)-a-1;
	for(int i=1;i<=ca;++i)e[i].clear();
	for(int i=1;i<=n;++i){
		p[i].x=lower_bound(a+1,a+ca+1,p[i].x)-a;
		e[p[i].x].push_back(p[i].y);
	}
	for(int i=1;i<=ca;++i)sort(e[i].begin(),e[i].end());
	mx=0,mn=n,su[ca+1]=0;
	S.clear();
	for(int i=1,ad=0;i<=ca;++i){
		vector<int>g;
		for(auto v:e[i]){
			if(S.count(v-ad))g.push_back(v-ad);
			S.insert(v-ad);
		}
		for(auto v:g)S.erase(v);
		pr[i]=S.size();
		ad+=a[i+1]-a[i];
	}
	S.clear();
	for(int i=ca,ad=0;i;--i){
		vector<int>g;
		for(auto v:e[i]){
			if(S.count(v-ad))g.push_back(v-ad);
			S.insert(v-ad);
		}
		for(auto v:g)S.erase(v);
		su[i]=S.size();
		ad+=a[i]-a[i-1];
	}
	for(int i=1;i<=ca;++i){
		mx=max(mx,pr[i-1]+su[i+1]+(int)e[i].size()),mn=min(mn,pr[i-1]+su[i+1]+(int)e[i].size());
		if(i==1||a[i-1]+1<a[i])mx=max(mx,pr[i-1]+su[i]),mn=min(mn,pr[i-1]+su[i]);
	}
	mx=max(mx,pr[ca]),mn=min(mn,pr[ca]);
	printf("%d %d\n",mn,mx);
}
int main(){
	scanf("%d",&T);
	while(T--)solve();
	return 0;
}