#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>

#define ll long long
#define ull unsigned long long
#define pii std :: pair<int, int>
#define pb push_back
#define fi first
#define se second
#define lep(i, l, r) for(int i = l; i <= r; i++)
#define rep(i, r, l) for(int i = r; i >= l; i--)
#define mset(s, t) memset(s, t, sizeof(s))
#define mcpy(s, t) memcpy(s, t, sizeof(t))

template <typename T1, typename T2> void Min(T1 &x, T2 y) {
	if (x > y) x = y;
}

template <typename T1, typename T2> void Max(T1 &x, T2 y) {
	if (x < y) x = y;
}

int read() {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= ch == '-', ch = getchar();
	while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();
	return f ? -x : x;
}

template <typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> void Print(T x, char let) {
	print(x), putchar(let);
}

const int N = 1e5 + 5;

int T, n, m;
int deg[N];

int main() {
	T = read();
	while (T--) {
		mset(deg, 0);
		n = read(), m = read();
		for(int i = 1, u, v; i <= m; i++) deg[u = read()]++, deg[v = read()]++;
		std :: sort(deg + 1, deg + n + 1);
		int cnt = 0, ans1 = 1, ans2 = 1;
		for (int i = n; i; i--) if(deg[i] >= cnt) cnt++;
		int C = 0, res = 0;
		for (int i = n; i; i--) {
			if (deg[i] >= C) {
				C++;
				if(deg[i] == cnt - 1) res++;
				else if(deg[i] == cnt) ans2++;
			}
			else if(deg[i] == cnt - 1) ans1++;
		}
		if(res) ans2 = res;
		printf("%d %d\n", ans1 ,ans2);
	}
	return 0;
}