//
// Created by Barichek on 22.07.2023 14:00:51
//

#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define PB push_back

#define all(a) a.begin(), a.end()
#define len(a) (int) (a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

#ifdef Energy_is_not_over
#define DEBUG for (bool ____DEBUG = true; ____DEBUG; ____DEBUG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = 1e5+10, inf = 1000111222;

int have[2*max_n];

int T;

void solve()
{
    int n,y0;
    cin>>n>>y0;
    y0++;
    vector<pii> xy(n);
    for (int i=0;i<n;i++){
        cin>>xy[i].fir>>xy[i].sec;
        xy[i].fir++;
        xy[i].sec++;
    }
    vector<int> Xs;
    for (auto i:xy){
        Xs.pb(i.fir-1);
        Xs.pb(i.fir);
        Xs.pb(i.fir+1);
    }
    sort(all(Xs));
    Xs.resize(unique(all(Xs))-Xs.begin());
    vector<int> ans(len(Xs),0);
    DEBUG{
        for (auto i:Xs){
            cerr<<i<<" ";
        }
        cerr<<"\n";
    };
    for (int i=0;i<len(Xs);i++){
//        LOG(i,ans[i]);
//        LOG(i,Xs[i],lower_bound(all(xy),mp(Xs[i],+inf))-lower_bound(all(xy),mp(Xs[i]-1,+inf)));
        ans[i]+=lower_bound(all(xy),mp(Xs[i],+inf))-lower_bound(all(xy),mp(Xs[i]-1,+inf));
    }
    DEBUG{
        cerr<<"after base ans :: ";
        for (int i=0;i<len(Xs);i++){
            cerr<<Xs[i]<<" "<<ans[i]<<", ";
        }
        cerr<<"\n";
    };
    {
        T++;
        int cnt_have_equal_T=0;
        int p=0;
        for (int X_id=0;X_id<len(Xs);X_id++){
            const int X=Xs[X_id];
            int r_p=p;
            while (r_p<len(xy) && xy[r_p].fir<X){
                r_p++;
            }
            for (int i=p;i<r_p;i++){
                int val=max_n-xy[i].fir+abs(y0-xy[i].sec);
                if (have[val]<T){
                    have[val]=T;
                    cnt_have_equal_T++;
                }
                else{
                    cnt_have_equal_T-=(have[val]==T);
                    have[val]=T+1;
                }
            }
            for (int i=p;i<r_p;i++){
                int val=max_n-xy[i].fir+abs(y0-xy[i].sec);
                if (have[val]==T+1){
                    have[val]=-1;
                }
            }
            ans[X_id]+=cnt_have_equal_T;
            p=r_p;
        }
    }
    DEBUG{
        cerr<<"after left ans :: ";
        for (int i=0;i<len(Xs);i++){
            cerr<<Xs[i]<<" "<<ans[i]<<", ";
        }
        cerr<<"\n";
    };
    {
        T++;
        int cnt_have_equal_T=0;
        int p=len(xy)-1;
        for (int X_id=len(Xs)-1;X_id>=0;X_id--){
            const int X=Xs[X_id];
            int r_p=p;
            while (r_p>=0 && xy[r_p].fir>X){
                r_p--;
            }
            for (int i=p;i>r_p;i--){
                int val=xy[i].fir+abs(y0-xy[i].sec);
                if (have[val]<T){
                    have[val]=T;
                    cnt_have_equal_T++;
                }
                else{
                    cnt_have_equal_T-=(have[val]==T);
                    have[val]=T+1;
                }
            }
            for (int i=p;i>r_p;i--){
                int val=xy[i].fir+abs(y0-xy[i].sec);
                if (have[val]==T+1){
                    have[val]=-1;
                }
            }
            ans[X_id]+=cnt_have_equal_T;
            p=r_p;
        }
    }
    DEBUG{
        cerr<<"after right ans :: ";
        for (int i=0;i<len(Xs);i++){
            cerr<<Xs[i]<<" "<<ans[i]<<", ";
        }
        cerr<<"\n";
    };
    cout<<*min_element(all(ans))<<" "<<*max_element(all(ans))<<"\n";
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int tests;
    cin>>tests;
    while (tests--){
        solve();
    }
    return 0;
}