#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPL(i,j, n) for (int i = (j); i < (n); i++)
#define int long long
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int MAXX = 1e6;

int curman[MAXX*2];

vi toclear;
void solve() {
    int n,y0;cin>>n>>y0;
    vii arr(n);
    map<int, vi> events;
    // parity here...
    set<int> tocheck;

    REP(i, n) {
        int x,y;cin>>x>>y;
        tocheck.insert(x);
        tocheck.insert(x+1);
        y -= y0;
        arr[i] = {x,y};
        events[x].push_back(y);
    }
    tocheck.insert(0);
    vi checkarr;
    for (auto x: tocheck) {
        checkarr.push_back(x);
    }

    int gg = checkarr.size();
    vi sizes(gg);
    vector<vii> realevents(gg);
    REP(i, gg) {
        int x = checkarr[i];
        vi &vec = events[x];
        map<int,int>  ctmp;
        sizes[i] = vec.size();
        for (auto y: vec) {
            ctmp[abs(y)]++;
        }
        for (auto [y,ct]: ctmp) {
            realevents[i].push_back({y, ct});
        }
    }

    vi arrL(gg,0);
    vi arrR(gg,0);
    int curval = 0;

    REPL(i, 1, gg) {
        int x = checkarr[i -1];
        for (auto [y, ct]: realevents[i-1]) {
            int v = MAXX-x+y;      
            curval -= curman[v];
            if (ct == 2) {
                curman[v] = 0;
            } else {
                curman[v] = 1 - curman[v];
            }
            curval += curman[v];
            toclear.push_back(v);
        }
        arrL[i] = curval;
    }
    for (auto x: toclear) {
        curman[x] = 0;
    }
    toclear.clear();
    curval = 0;
    for (int idx = gg-2; idx >=0; idx--) {
        int x = checkarr[idx+1];
         for (auto [y, ct]: realevents[idx + 1]) {
            int v = x+y;      
            curval -= curman[v];
            if (ct == 2) {
                curman[v] = 0;
            } else {
                curman[v] = 1 - curman[v];
            }
            curval += curman[v];
            toclear.push_back(v);
        }
        arrR[idx] = curval;
    }
    for (auto x: toclear) {
        curman[x] = 0;
    }
    toclear.clear();
    // for (auto x: checkarr) {
    //     cout<<x<<" ";
    // }cout<<"\n";
    // for (auto x: arrR) {
    //     cout<<x<<" ";
    // }cout<<"\n";
    int mn = n;
    int mx = 0;
    REP(i, gg) {
        int c = arrL[i] + arrR[i] + sizes[i];
        mn = min(mn, c);
        mx = max(mx, c);
    }
    cout<<mn<<" "<<mx<<"\n";
}
signed  main() {
    memset(curman, 0, sizeof(curman));
   ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin >> t;
    while (t--) {
        solve();
    }
}