#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N, Y0;
vector<int> X, Y;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &Y0);
    X.resize(N);
    Y.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d%d", &X[i], &Y[i]);
    }
    
    // (x, t)
    vector<pair<int, int>> ps(N);
    for (int i = 0; i < N; ++i) {
      ps[i] = make_pair(X[i], abs(Y[i] - Y0));
    }
    sort(ps.begin(), ps.end());
// cerr<<"ps = "<<ps<<endl;
    
    vector<int> ls(N + 1, 0), rs(N + 1, 0);
    {
      vector<int> zs(N);
      for (int i = 0; i < N; ++i) {
        zs[i] = ps[i].first - ps[i].second;
      }
      sort(zs.begin(), zs.end());
      zs.erase(unique(zs.begin(), zs.end()), zs.end());
      const int zsLen = zs.size();
      vector<int> freq(zsLen, 0);
      for (int i = 0; i < N; ++i) {
        const int pos = lower_bound(zs.begin(), zs.end(), ps[i].first - ps[i].second) - zs.begin();
        if (i - 1 >= 0 && ps[i - 1] == ps[i]) {
          ls[i + 1] = ls[i] - freq[pos];
          freq[pos] = 0;
        } else {
          ls[i + 1] = ls[i] + (freq[pos] ? -1 : +1);
          freq[pos] ^= 1;
        }
      }
    }
    {
      vector<int> zs(N);
      for (int i = 0; i < N; ++i) {
        zs[i] = ps[i].first + ps[i].second;
      }
      sort(zs.begin(), zs.end());
      zs.erase(unique(zs.begin(), zs.end()), zs.end());
      const int zsLen = zs.size();
      vector<int> freq(zsLen, 0);
      for (int i = N; --i >= 0; ) {
        const int pos = lower_bound(zs.begin(), zs.end(), ps[i].first + ps[i].second) - zs.begin();
        if (i + 1 < N && ps[i] == ps[i + 1]) {
          rs[i] = rs[i + 1] - freq[pos];
          freq[pos] = 0;
        } else {
          rs[i] = rs[i + 1] + (freq[pos] ? -1 : +1);
          freq[pos] ^= 1;
        }
      }
    }
// cerr<<"ls = "<<ls<<", rs = "<<rs<<endl;
    
    int ansMin = N + 1, ansMax = -1;
    
    // exact
    for (int i = 0, j; i < N; i = j) {
      for (j = i; j < N && ps[i].first == ps[j].first; ++j) {}
      chmin(ansMin, ls[i] + (j - i) + rs[j]);
      chmax(ansMax, ls[i] + (j - i) + rs[j]);
    }
    
    // between
    for (int i = 0; i <= N; ++i) if (i == 0 || i == N || ps[i - 1].first + 1 < ps[i].first) {
      chmin(ansMin, ls[i] + rs[i]);
      chmax(ansMax, ls[i] + rs[i]);
    }
    
    printf("%d %d\n", ansMin, ansMax);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}