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

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;
using pii = pair<int, int>;
using uint = uint32_t;
using ull = uint64_t;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

template <class F>
struct ycr {
	F f;
	template <class T> explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args> decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F> decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

const int N = 1e5 + 100;

struct dushu {
	int id, d;
} a[N];

inline bool cmp(dushu x, dushu y) { return x.d > y.d; }

inline void solve() {
	int n, m;
	cin >> n >> m;
	F(i, 1, n) { a[i].id = i; a[i].d = 0; }
	F(i, 1, m) {
		int x, y;
		cin >> x >> y;
		++a[x].d;
		++a[y].d;
	}
	sort(a + 1, a + n + 1, cmp);
	int MX = n;
	F(i, 1, n) if (a[i].d < i) { if (a[i].d == i - 1) MX = i; else MX = i - 1; break; }
	int ans1 = 1;
	F(i, MX + 1, n) {
		if (a[i].d < MX - 1) break;
		++ans1;
	}
	if (a[MX].d == MX - 1) --MX;
	int ans2 = 1;
	DF(i, MX, 1) {
		if (a[i].d > MX) break;
		++ans2;
	}
	cout << ans1 << ' ' << ans2 << '\n';
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);
	int T; cin >> T;
	while (T--) solve();
}