#include <bits/stdc++.h>

using i64 = long long;

void solve() {
	int n, y0;
	std::cin >> n >> y0;

	std::vector<int> x(n), y(n);
	std::vector<int> v;
	for (int i = 0; i < n; i++) {
		std::cin >> x[i] >> y[i];
		v.push_back(x[i] - 1);
		v.push_back(x[i]);
		v.push_back(x[i] + 1);
	}
	std::sort(v.begin(), v.end());
	v.erase(std::unique(v.begin(), v.end()), v.end());

	int m = v.size();
	std::vector<int> ans(m);
	auto get = [&](int x) {
		return std::lower_bound(v.begin(), v.end(), x) - v.begin();
	};
	for (int i = 0; i < n; i++) {
		int t = get(x[i]);
		ans[t] += 1;
		ans[t + 1] -= 1;
	}

	std::map<int, std::vector<int>> f;
	for (int i = 0; i < n; i++) {
		f[-x[i] + std::abs(y[i] - y0)].push_back(i);
	}
	for (auto [_, p] : f) {
		std::sort(p.begin(), p.end(), [&](int i, int j) {
			return x[i] < x[j];
		});

		for (int i = 0; i < p.size(); ) {
			if (i + 1 == p.size()) {
				int t = get(x[p[i]] + 1);
				ans[t] += 1;
				break;
			} else {
				int t = get(x[p[i]] + 1);
				ans[t] += 1;
				t = get(x[p[i + 1]] + 1);
				ans[t] -= 1;
				i += 2;
				if (i < p.size() && x[p[i]] == x[p[i - 1]]) {
					i += 1;
				}
			}
		}
	}

	f.clear();
	for (int i = 0; i < n; i++) {
		f[x[i] + std::abs(y[i] - y0)].push_back(i);
	}
	for (auto [_, p] : f) {
		std::sort(p.begin(), p.end(), [&](int i, int j) {
			return x[i] > x[j];
		});

		for (int i = 0; i < p.size(); ) {
			if (i + 1 == p.size()) {
				int t = get(x[p[i]]);
				ans[0] += 1;
				ans[t] -= 1;
				break;
			} else {
				int t = get(x[p[i]]);
				ans[t] -= 1;
				t = get(x[p[i + 1]]);
				ans[t] += 1;
				i += 2;
				if (i < p.size() && x[p[i]] == x[p[i - 1]]) {
					i += 1;
				}
			}
		}
	}

	for (int i = 1; i < m; i++) {
		ans[i] += ans[i - 1];
	}
	int pmin = *std::min_element(ans.begin(), ans.end());
	int pmax = *std::max_element(ans.begin(), ans.end());
	std::cout << pmin << " " << pmax << "\n";
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int T;
	std::cin >> T;

	while (T--) {
		solve();
	}

	return 0;
}