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

const int N=1e5+100;
struct node{
    int x,y;
}g[N];

map<int,int> B,C;
int qz1[N],qz2[N],Type[N],Las[N];

bool cmp(node n1,node n2) {return (n1.x<n2.x);}

int main()
{

    int T;
    scanf("%d",&T);
    while(T--){
        int n,y0;
        scanf("%d%d",&n,&y0);
        for(int i=1;i<=n;i++) scanf("%d%d",&g[i].x,&g[i].y);

        sort(g+1,g+n+1,cmp);

        B.clear();qz1[0]=0;
        int cnt1=0,cnt2=0;
        for(int i=1;i<=n;i++){
            int tmp=abs(g[i].y-y0)-g[i].x;
            if(B[tmp]==0) B[tmp]=++cnt1;
            tmp=B[tmp];
            if(Type[tmp]==0){
                if(Las[tmp]!=g[i].x)
                    Type[tmp]=1,qz1[i]=qz1[i-1];
                else
                    qz1[i]=qz1[i-1]+1;
            }
            else{
                Type[tmp]=0;
                Las[tmp]=g[i].x;
                qz1[i]=qz1[i-1]+2;
            }
        }
        for(int i=1;i<=cnt1;i++) Type[i]=Las[i]=0;

        C.clear();qz2[n+1]=0;
        for(int i=n;i>=1;i--){
            int tmp=abs(g[i].y-y0)+g[i].x;
            if(C[tmp]==0) C[tmp]=++cnt2;
            tmp=C[tmp];
            if(Type[tmp]==0){
                if(Las[tmp]!=g[i].x)
                    Type[tmp]=1,qz2[i]=qz2[i+1];
                else
                    qz2[i]=qz2[i+1]+1;
            }
            else{
                Type[tmp]=0;
                Las[tmp]=g[i].x;
                qz2[i]=qz2[i+1]+2;
            }
        }
        for(int i=1;i<=cnt2;i++) Type[i]=Las[i]=0;


        int las=0,mx=qz2[1],mn=qz2[1];
        for(int i=1;i<=n;i++)
            if(i==n||g[i].x!=g[i+1].x){
                mx=max(mx,qz1[las]+qz2[i+1]);
                mn=min(mn,qz1[las]+qz2[i+1]);
                if(i==n||g[i+1].x-1>g[i].x){
                    mx=max(mx,qz1[i]+qz2[i+1]);
                    mn=min(mn,qz1[i]+qz2[i+1]);
                }
                las=i;
            }

        printf("%d %d\n",n-mx,n-mn);
    }

    return 0;
}