#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define sz(a) ((int) a.size())
#define vi vector<int>
#define ll long long
#define me(f, x) memset(f, x, sizeof(f))  
#define ull unsigned long long 
using namespace std;
const int N = 4e5 + 7;
int n, m;
int deg[N];
ll sum[N];
ll pre[N];
int cnt[N], cur[N];
int ord[N];

int su[N], sv[N], vis[N];
void Main() {
	cin >> n >> m;
	L(t, 1, m) {
		int u, v;
		cin >> u >> v;
		su[t] = u, sv[t] = v;
		++deg[u];
		++deg[v];
	}
	L(i, 1, n) ord[i] = i;
	sort(ord + 1, ord + n + 1, [&](int x, int y) {
		return deg[x] > deg[y];
	});
	L(i, 1, n) 
		pre[i] = pre[i - 1] + deg[ord[i]];
	
	int pos = -1;
	R(i, n, 0) {
		if(pre[i] == (ll) i * (i - 1) / 2 + m) {
			pos = i;
			break;
		}
	}
	L(i, 1, pos) vis[ord[i]] = 1;
	
	ll cnt1 = 0, cnt2 = 0;
	
	L(i, 1, n) {
		if(vis[i]) {
			if(deg[i] == pos - 1) {
				++cnt2;
			}
		} else {
			if(deg[i] == pos) {
				++cnt1;
			}
		}
	}
	
	if(!cnt1) {
		cnt1 = 1;
		L(i, 1, n) if(!vis[i] && deg[i] == pos - 1) ++cnt1;
	}
	
	if(!cnt2) {
		cnt2 = 1;
		L(i, 1, n) if(vis[i] && deg[i] == pos) ++cnt2;
	}
	
//	L(i, 1, n) cout << vis[i];
//	cout << " : ";
	cout << cnt1 << ' ' << cnt2 << '\n';
	
	L(i, 1, n) {
		deg[i] = 0, vis[i] = 0;
	}
}
int main() {
	ios :: sync_with_stdio (false);
	cin.tie (0); cout.tie (0);
	int t; cin >> t; while(t--) Main();
	return 0;
}