#include <bits/stdc++.h>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)

const int N = 1e5 + 5;
const int Inf = 1e9;

int n, m, Y, MN, MX;
int cnt[N], pos[3 * N], ans[3 * N];
struct Node {
  int x, y;
  bool operator<(const Node &b) const {
    return x < b.x;
  }
} a[N];

void solve() {
  MN = Inf, MX = -Inf, m = 0;
  cin >> n >> Y;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].x >> a[i].y;
    cnt[a[i].x]++;
    pos[++m] = a[i].x - 1;
    pos[++m] = a[i].x;
    pos[++m] = a[i].x + 1;
  }
  sort(a + 1, a + n + 1);
  sort(pos + 1, pos + m + 1);
  m = unique(pos + 1, pos + m + 1) - pos - 1;
  int cur = 1;
  map<int, int> mp;
  for (int i = 1; i <= m; ++i) {
    int X = pos[i];
    ans[i] = cnt[X];
    vector<int> p;
    while (cur <= n && a[cur].x < X) {
      int d = -a[cur].x + abs(a[cur].y - Y);
      mp[d]++;
      p.push_back(d);
      cur++;
    }
    for (auto d : p) {
      if (mp.find(d) != mp.end() && mp[d] > 1) {
        mp.erase(mp.find(d));
      }
    }
    ans[i] += mp.size();
  }
  mp.clear();
  cur = n;
  for (int i = m; i; --i) {
    int X = pos[i];
    vector<int> p;
    while (cur >= 1 && a[cur].x > X) {
      int d = a[cur].x + abs(a[cur].y - Y);
      mp[d]++;
      p.push_back(d);
      cur--;
    }
    for (auto d : p) {
      if (mp.find(d) != mp.end() && mp[d] > 1) {
        mp.erase(mp.find(d));
      }
    }
    ans[i] += mp.size();
  }
  for (int i = 1; i <= m; ++i) {
    MN = min(MN, ans[i]);
    MX = max(MX, ans[i]);
    ans[i] = 0;
  }
  for (int i = 1; i <= n; ++i) {
    cnt[a[i].x]--;
  }
  cout << MN << " " << MX << "\n";
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}