#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=4e5+1;
#define fi first
#define se second

#define all(x) (x).begin(), (x).end()

int n;
ll x[N],y[N];
vector<int> mp2[N];
map<ll,int>dx;
void add(ll l,ll r,ll v){
    //cout << "add " << l << ' ' << r << ' ' << v << endl;
    if(v==0) return;
    dx[l]+=v;
    dx[r+1]-=v;
}
void solve(){
    ll y0;
    cin >> n >> y0;
    dx.clear();
    {//
        ll sex=-2e18;sex+=1;
        dx[sex]=0;
    }

    vector<ll> coords;
    for(int i=1; i<=n ;i++){
        cin >> x[i] >> y[i];
        y[i]-=y0;
    }

    for(int i = 1; i <= n; ++i){
        coords.push_back(-x[i] + abs(y[i]));
    }

    sort(all(coords));
    coords.resize(unique(all(coords)) - coords.begin());

    for(int i = 1; i <= n; ++i){
        int idx = lower_bound(all(coords), -x[i] + abs(y[i])) - coords.begin();
        mp2[idx].push_back(i);
    }

    for(int j = 0; j < coords.size(); ++j){
        auto &c = mp2[j];
        if(c.empty()) continue;
        //cout << "doingL " << e.fi << endl;
        vector<pair<int,int> >v;
        for(auto d:c) v.push_back({x[d],d});
        sort(v.begin(),v.end());
        int chp=0;
        for(int i=0; i<v.size() ;i++){
            if(i!=v.size()-1 && v[i+1].fi==v[i].fi) continue;
            ll cur=v[i].fi;
            ll nxt=2e18;
            if(i+1!=v.size()) nxt=v[i+1].fi;
            if(i>0 && v[i-1].fi==v[i].fi){
                add(cur,cur,2+chp);
                chp=0;
            }
            else{
                add(cur,cur,chp+1);
                chp^=1;
                add(cur+1,nxt-1,chp);
            }
        }
    }

    
    for(int i = 0; i < coords.size(); ++i)
        mp2[i].clear();
    coords.clear();

    for(int i = 1; i <= n; ++i){
        coords.push_back(x[i] + abs(y[i]));
    }

    sort(all(coords));
    coords.resize(unique(all(coords)) - coords.begin());

    for(int i = 1; i <= n; ++i){
        int idx = lower_bound(all(coords), x[i] + abs(y[i])) - coords.begin();
        mp2[idx].push_back(i);
    }

    for(int j = 0; j < coords.size(); ++j){
        auto &c = mp2[j];
        if(c.empty()) continue;

        //cout << "doingR " << e.fi << endl;
        vector<pair<int,int> >v;
        for(auto d:c) v.push_back({x[d],d});
        sort(v.begin(),v.end());
        reverse(v.begin(),v.end());
        int chp=0;
        for(int i=0; i<v.size() ;i++){
            if(i!=v.size()-1 && v[i+1].fi==v[i].fi) continue;
            ll cur=v[i].fi;
            ll nxt=-2e18;
            if(i+1!=v.size()) nxt=v[i+1].fi;
            if(i>0 && v[i-1].fi==v[i].fi){
                add(cur,cur,chp);
                chp=0;
            }
            else{
                add(cur,cur,chp);
                chp^=1;
                add(nxt+1,cur-1,chp);
            }
        }
    }
    ll cur=0;
    ll mn=2e18;
    ll mx=-2e18;
    for(auto d:dx){
        if(d.fi>1.5e18) break;
        cur+=d.se;
        mn=min(mn,cur);
        mx=max(mx,cur);
    }
    cout << mn << ' ' << mx << '\n';

    for(int i = 0; i < coords.size(); ++i)
        mp2[i].clear();
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int t;cin >> t;
    while(t--) solve();
}