#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=2e5+1;
#define fi first
#define se second
int n;
ll x[N],y[N];
map<ll,vector<int> >mp;
map<ll,int>dx;
void add(ll l,ll r,ll v){
	//cout << "add " << l << ' ' << r << ' ' << v << endl;
	if(l>r) return;
	dx[l]+=v;
	dx[r+1]-=v;
}
void solve(){
	ll y0;
	cin >> n >> y0;
	mp.clear();dx.clear();
	for(int i=1; i<=n ;i++){
		cin >> x[i] >> y[i];
		y[i]-=y0;
		mp[-x[i]+abs(y[i])].push_back(i);
	}
	for(auto &e:mp){
		//cout << "doingL " << e.fi << endl;
		auto &c=e.se;
		vector<pair<int,int> >v;
		for(auto d:c) v.push_back({x[d],d});
		sort(v.begin(),v.end());
		int chp=0;
		for(int i=0; i<v.size() ;i++){
			if(i!=v.size()-1 && v[i+1].fi==v[i].fi) continue;
			ll cur=v[i].fi;
			ll nxt=2e18;
			if(i+1!=v.size()) nxt=v[i+1].fi;
			if(i>0 && v[i-1].fi==v[i].fi){
				add(cur,cur,2+chp);
				add(cur+1,nxt-1,0);
				chp=0;
			}
			else{
				add(cur,cur,chp+1);
				chp^=1;
				add(cur+1,nxt-1,chp);
			}
		}
	}
	mp.clear();
	for(int i=1; i<=n ;i++){
		mp[x[i]+abs(y[i])].push_back(i);
	}
	for(auto &e:mp){
		//cout << "doingR " << e.fi << endl;
		auto &c=e.se;
		vector<pair<int,int> >v;
		for(auto d:c) v.push_back({x[d],d});
		sort(v.begin(),v.end());
		reverse(v.begin(),v.end());
		int chp=0;
		for(int i=0; i<v.size() ;i++){
			if(i!=v.size()-1 && v[i+1].fi==v[i].fi) continue;
			ll cur=v[i].fi;
			ll nxt=-2e18;
			if(i+1!=v.size()) nxt=v[i+1].fi;
			if(i>0 && v[i-1].fi==v[i].fi){
				add(cur,cur,chp);
				add(nxt+1,cur-1,0);
				chp=0;
			}
			else{
				add(cur,cur,chp);
				chp^=1;
				add(nxt+1,cur-1,chp);
			}
		}
	}
	ll cur=0;
	ll mn=2e18;
	ll mx=-2e18;
	for(auto d:dx){
		if(d.fi>1.5e18) break;
		cur+=d.se;
		mn=min(mn,cur);
		mx=max(mx,cur);
	}
	cout << mn << ' ' << mx << '\n';
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	int t;cin >> t;
	while(t--) solve();
}