#include <bits/stdc++.h>
using namespace std;

const int INF=1e7;
const int maxn=200000;

int T,n,Y;
pair<int,int> a[maxn+50];
int v[maxn+50];
int cnt[maxn+50];
int pre[maxn+50];
int suf[maxn+50];
bool notok[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> T;
	for (;T--;){
		cin >> n >> Y;
		for (int i=1;i<=n;i++){
			cin >> a[i].first >> a[i].second;
			a[i].second-=Y;
		}
		sort(a+1,a+n+1);
		
		{
			set<pair<int,int>> s;
			for (int i=1;i<=n;i++) s.insert(a[i]);
			
			for (int i=1;i<=n;i++){
				if (a[i].second==0) continue;
				if (s.count(make_pair(a[i].first,-a[i].second))) notok[i]=1;
			}
		}
		
		map<int,int> dict;
		for (int i=1;i<=n;i++) dict[a[i].first]++;
		
		int tot=0;
		for (auto [x,y]:dict){
			++tot;
			v[tot]=x;
			cnt[tot]=y;
		}
		v[0]=-INF;v[tot+1]=INF;
		/*
		cerr << "--------------" << endl;
		for (int i=1;i<=n;i++){
			cerr << "(" << a[i].first << "," << a[i].second << ")" << endl;
		}
		cerr << "tot : " << tot << endl;
		cerr << "v[] : ";
		for (int i=1;i<=tot;i++) cerr << v[i] << " ";
		cerr << endl;
		cerr << "cnt[] : ";
		for (int i=1;i<=tot;i++) cerr << cnt[i] << " ";
		cerr << endl;
		*/
		{
			set<int> s;
			int l=1,r=1;
			for (int sel=1;sel<=n;sel++){
				for (r=l;r<=n && a[r].first==v[sel];r++);
				for (int i=l;i<r;i++){
					int now=abs(a[i].second)-a[i].first;
					if (notok[i]){
						if (s.count(now)) s.erase(now);
					}
					else{
						if (s.count(now)) s.erase(now);
						else s.insert(now);	
					}
				}
				pre[sel]=(int)s.size();
				l=r;
			}
		}
		{
			set<int> s;
			int l=n,r=n;
			for (int sel=n;sel>=1;sel--){
				for (l=r;l>=1 && a[l].first==v[sel];l--);
				for (int i=r;i>l;i--){
					int now=abs(a[i].second)+a[i].first;
					if (notok[i]){
						if (s.count(now)) s.erase(now);
					}
					else{
						if (s.count(now)) s.erase(now);
						else s.insert(now);	
					}
				}
				suf[sel]=(int)s.size();
				r=l;
			}
		}
		
		int mnans=INF,mxans=0;
		for (int i=1;i<=tot;i++){
			int now=pre[i-1]+cnt[i]+suf[i+1];
			mnans=min(mnans,now);
			mxans=max(mxans,now);		
		}
		for (int i=1;i<=tot+1;i++){
			if (v[i]==v[i-1]+1) continue;
			int now=pre[i-1]+suf[i];
			mnans=min(mnans,now);
			mxans=max(mxans,now);		
		}
		/*
		cerr << "pre[] : ";
		for (int i=1;i<=tot;i++) cerr << pre[i] << " ";
		cerr << endl;
		cerr << "suf[] : ";
		for (int i=1;i<=tot;i++) cerr << suf[i] << " ";
		cerr << endl;
		
		cout << "mnans,mxans : ";
		*/
		cout << mnans << " " << mxans << "\n";
		for (int i=0;i<=tot+1;i++){
			v[i]=cnt[i]=0;
			pre[i]=suf[i]=0;
		}
		for (int i=1;i<=n;i++){
			notok[i]=0;	
		}
	}
	return 0;	
}