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

void solve() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> adj(n);
	vector<pair<int, int>> edge(m);
	for (auto &[u, v] : edge) {
		cin >> u >> v;
		u--, v--;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	vector<vector<int>> d(n);
	for (int i = 0; i < n; i++) {
		d[adj[i].size()].push_back(i);
	}
	vector<bool> clique(n);
	int sz = 0;
	for (int i = n - 1; i >= 0; i--) {
		for (int x : d[i]) {
			int cnt = 0;
			for (int y : adj[x]) {
				cnt += clique[y];
			}
			if (cnt == sz) {
				clique[x] = 1;
				sz++;
			}
		}
	}
	int ans = 1;
	vector<int> in(n), out(n);
	for (auto [u, v] : edge) {
		if (clique[u] && !clique[v]) {
			in[u]++;
			out[v]++;
		} else if (clique[v] && !clique[u]) {
			in[v]++;
			out[u]++;
		}
	}
	for (int i = 0; i < n; i++) {
		if (!clique[i] && out[i] == sz - 1) {
			ans++;
		}
	}
	int c0 = 0, c1 = 0;
	for (int i = 0; i < n; i++) {
		if (clique[i]) {
			if (!in[i]) {
				c0++;
			} else if (in[i] == 1) {
				c1++;
			}
		}
	}
	cout << ans << " " << (c0 ? c0 : c1 + 1) << "\n";
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}