#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10;
typedef pair<int,int> ii;
#define ff first
#define ss second
int n,Y,m;
vector <int> d;
int pre[maxn],suf[maxn];
ii a[maxn];
map<int,bool> mp;
bool cmp(ii x, ii y)
{
    return x.ff>y.ff;
}
void xuly()
{
    cin>>n>>Y;
    for (int i=1; i<=n; i++) cin>>a[i].ff>>a[i].ss,d.push_back(a[i].ff);
    int it=1;
    sort(d.begin(),d.end());
    d.resize(unique(d.begin(),d.end())-d.begin());
    m=d.size();
    sort(a+1,a+n+1);
    mp.clear();
    pre[0] = 0;
    for (int i=1; i<=m; i++)
    {
        pre[i] = pre[i-1];
        vector <int> tmp;
        while (it<=n&&a[it].ff<=d[i-1])
        {
            int val = abs(a[it].ss-Y) - a[it].ff;
            tmp.push_back(val);

            it++;
        }
        int l,r;
        sort(tmp.begin(),tmp.end());
        for (int j=0; j<tmp.size(); j++)
        {
            if (j==0||tmp[j]!=tmp[j-1]) l=j;
            if (j==tmp.size()+1||tmp[j]!=tmp[j+1])
            {
                r=j;
                int val = tmp[j];
                if (mp.count(val))
                {
                    mp[val]=0;
                    pre[i]-=(r-l+2);
                }
                else if (r-l+1>1)
                {
                    pre[i]-=(r-l+1);
                }
                else mp[val]=1;
            }
        }
    }
    sort(a+1,a+n+1,cmp);
    mp.clear();
    suf[m+1] = 0;
    it=1;
    for (int i=m; i>=1; i--)
    {
        suf[i]=suf[i+1];
        vector <int> tmp;
        while (it<=n&&a[it].ff>=d[i-1])
        {
            int val = abs(a[it].ss-Y) + a[it].ff;
            tmp.push_back(val);

            it++;
        }
        int l,r;
        sort(tmp.begin(),tmp.end());
        for (int j=0; j<tmp.size(); j++)
        {
            if (j==0||tmp[j]!=tmp[j-1]) l=j;
            if (j==tmp.size()+1||tmp[j]!=tmp[j+1])
            {
                r=j;
                int val = tmp[j];
//                cout<<i<<' '<<r-l+1<<' '<<val<<'\n';
                if (mp.count(val))
                {
                    mp[val]=0;
                    suf[i]-=(r-l+2);
                }
                else if (r-l+1>1)
                {
                    suf[i]-=(r-l+1);
                }
                else mp[val]=1;
            }
        }
    }
    int mmax = max(pre[m]+n,n+suf[1]); int mmin = min(n+pre[m],n+suf[1]);
//    for (int i=0; i<=m; i++) cout<<pre[i]<<' '; cout<<'\n';
//    for (int i=1; i<=m+1; i++) cout<<suf[i]<<' '; cout<<'\n';
    for (int i=1; i<=m; i++)
    {
        mmax = max(mmax,n+pre[i-1]+suf[i+1]);
        mmin = min(mmin,n+pre[i-1]+suf[i+1]);
        if (i>1&&abs(d[i-1]-d[i-2])>1)
        {
            mmax = max(mmax,n+pre[i-1]+suf[i]);
            mmin = min(mmin,n+pre[i-1]+suf[i]);
        }
    }
    cout<<mmin<<' '<<mmax<<'\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int tt; cin>>tt;
    while (tt--) xuly();
}