#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
template<class T> void chkmin(T &x,T y){if(y<x)x=y;}
template<class T> void chkmax(T &x,T y){if(y>x)x=y;}
typedef long long ll;
typedef pair<int,int> pii;
const int N=100005,INF=1000000007,M=100001;
int n,yy0;
int b[N*2],ans[N*2];
int ax[N*2],lenax;
pii p[N];
map<int,int> ma[N];
void lsh(int a[],int &len)
{
    sort(a+1,a+len+1);
    int l=1;
    For(i,2,len)
        if(a[i]!=a[l])a[++l]=a[i];
    len=l;
}
void Main()
{
    scanf("%d%d",&n,&yy0);
    For(i,1,n)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        p[i]={x,abs(y-yy0)};
        ma[x][p[i].second]++;
        ax[++lenax]=x;
        ans[x]++;
    }
    lsh(ax,lenax);
    For(i,1,lenax)ax[lenax+i]=ax[i]+1;
    lenax*=2; ax[++lenax]=ax[1]-1;
    lsh(ax,lenax);
    int cnt=0;
    For(i,1,lenax)
    {
        int x=ax[i];
        ans[x]+=cnt;
        //printf("1:x=%d,cnt=%d\n",x,cnt);
        for(auto [y,z]:ma[x])
            if(z==1)
            {
                b[M-x+y]^=1;
                if(b[M-x+y])cnt++;
                else cnt--;
            }
            else
            {
                if(b[M-x+y])cnt--;
                b[M-x+y]=0;
            }
    }
    For(i,1,n)b[M-p[i].first+p[i].second]=0;
    cnt=0;
    Rof(i,lenax,1)
    {
        int x=ax[i];
        ans[x]+=cnt;
        //printf("2:x=%d,cnt=%d\n",x,cnt);
        for(auto [y,z]:ma[x])
            if(z==1)
            {
                b[x+y]^=1;
                if(b[x+y])cnt++;
                else cnt--;
            }
            else
            {
                if(b[x+y])cnt--;
                b[x+y]=0;
            }
    }
    For(i,1,n)b[p[i].first+p[i].second]=0;
    int ans1=INF,ans2=0;
    For(i,1,lenax)chkmin(ans1,ans[ax[i]]),chkmax(ans2,ans[ax[i]]),ans[ax[i]]=0;
    For(i,1,n)ma[p[i].first].clear();
    lenax=0;
    printf("%d %d\n",ans1,ans2);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)Main();
}