#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int n, y0;
  cin >> n >> y0;
  vector<pair<int, int>> points(n);
  for (int i = 0; i < n; ++i)
    cin >> points[i].first >> points[i].second;
  sort(points.begin(), points.end());
  vector<int> allx(n);
  for (int i = 0; i < n; ++i)
    allx[i] = points[i].first;
  for (int i = 0; i + 1 < n; ++i) {
    if (allx[i] + 1 < allx[i + 1])
      allx.emplace_back(allx[i] + 1);
  }
  allx.emplace_back(allx[0] - 1);
  allx.emplace_back(allx[n - 1] + 1);
  sort(allx.begin(), allx.end());
  allx.resize(unique(allx.begin(), allx.end()) - allx.begin());
  map<int, int> answers;
  for (int _ = 0; _ < 2; ++_) {
    auto get_type = [&](pair<int, int> point) {
      if (_ == 0)
        return point.first - abs(point.second - y0);
      return point.first + abs(point.second - y0);
    };
    set<int> walking;
    int i = 0;
    for (int x : allx) {
      answers[x] += walking.size();
      map<int, int> new_types;
      int cur = 0;
      for (; i < n && points[i].first == x; ++i) {
        int t = get_type(points[i]);
        ++cur;
        ++new_types[t];
      }
      for (auto [t, c] : new_types) {
        if (walking.count(t)) {
          walking.erase(t);
        } else if (c == 1) {
          walking.emplace(t);
        }
      }
      if (_ == 0)
        answers[x] += cur;
    }
    reverse(allx.begin(), allx.end());
    reverse(points.begin(), points.end());
  }
  int mn = 1e9, mx = -1e9;
  for (auto [x, ans] : answers) {
    mn = min(mn, ans);
    mx = max(mx, ans);
  }
  cout << mn << ' ' << mx << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}