#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 300000
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int x,y;
    bool operator < (const reads &t)const
    {
	return x<t.x;
    }
};
reads st[N+1];
int T,n,y0,minn,maxn,tong[N+1],cnt[N+1],cnt2[N+1],cnt3[N+1],length;
bool used[N+1];
int main()
{
    int ps,ps2,res;
    T=read();
    while (T--)
    {
	n=read(),y0=read(),minn=inf,maxn=length=ps=res=0,ps2=1,tong[++length]=0;
	for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read(),cnt[st[i].x]++,tong[++length]=st[i].x,tong[++length]=st[i].x+1;
	sort(st+1,st+n+1),sort(tong+1,tong+length+1),length=unique(tong+1,tong+length+1)-tong-1;
	for (int i=1;i<=n;++i)
	{
	    cnt3[abs(st[i].y-y0)+st[i].x]++;
	    if (cnt3[abs(st[i].y-y0)+st[i].x]==1) res++;
	    if (cnt3[abs(st[i].y-y0)+st[i].x]==2) res--;
	}
	for (int i=1;i<=length;++i)
	{
	    while (ps+1<=n&&st[ps+1].x<tong[i])
	    {
		++ps,cnt2[abs(st[ps].y-y0)+100000-st[ps].x]++;
		if (cnt2[abs(st[ps].y-y0)+100000-st[ps].x]==1) res++;
		if (cnt2[abs(st[ps].y-y0)+100000-st[ps].x]==2) res--;
	    }
	    while (ps2<=n&&st[ps2].x<=tong[i])
	    {
		cnt3[abs(st[ps2].y-y0)+st[ps2].x]--;
		if (cnt3[abs(st[ps2].y-y0)+st[ps2].x]==1) res++;
		if (!cnt3[abs(st[ps2].y-y0)+st[ps2].x]) res--;
		++ps2;
	    }
	    minn=min(minn,res+cnt[tong[i]]),maxn=max(maxn,res+cnt[tong[i]]);
	}
	for (int i=1;i<=n;++i) cnt[st[i].x]--;
	for (int i=1;i<=ps;++i) cnt2[abs(st[i].y-y0)+100000-st[i].x]--;
	for (int i=ps2;i<=n;++i) cnt3[abs(st[i].y-y0)+st[i].x]--;
	printf("%d %d\n",minn,maxn);
    }
    return 0;
}