#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
i64 n, m;
i64 deg[100005];
i64 a[100005];
i64 b[100005];
i64 subb[100005];
i64 vis[100005];
vector<i64> g[100005];
void init(){
	for(int i = 1; i <= n; i++){
		deg[i] = 0;
		subb[i] = i;
		g[i].clear();
	}
}
bool cmp(i64 x, i64 y){
	return deg[x] > deg[y];
}

void solve(){
	cin >> n;
	cin >> m;
	init();
    for(int i = 1; i <= m; i++){
    	cin >> a[i];
    	cin >> b[i];
    	deg[a[i]]++;
    	deg[b[i]]++;
    	g[a[i]].push_back(b[i]);
    	g[b[i]].push_back(a[i]);
    }
    sort(subb+1,subb+1+n,cmp);
    i64 sub;
    vector<i64> g1;
    vector<i64> g2;
    g1.clear();
    g2.clear();
    for(int i = 1; i <= n; i++){
    	sub = subb[i];
    	if(deg[sub] >= i-1){
    		g1.push_back(sub);
    	}
    	else{
    		g2.push_back(sub);
    	}
    }
    i64 res1 = 1;
    i64 res2 = 1;
    i64 x, y, flag, num;
    for(int i = 0; i < g2.size(); i++){
    	x = g2[i];
    	if(deg[x] != g1.size() - 1){
    		continue;
    	}
    	flag = 1;
    	num = 0;
    	for(int j = 0; j < g1.size(); j++){
    		y = g1[j];
    		vis[y] = 0;
    	}
    	for(int j = 0; j < g[x].size(); j++){
    		y = g[x][j];
    		vis[y] = 1;
    	}
    	for(int j = 0; j < g1.size(); j++){
    		y = g1[j];
    		if(vis[y] == 1){
    			num++;
    		}
    		else{
    			if(deg[y] != g1.size() - 1){
    				flag = 0;
    			}
    		}
    	}
    	if(num != g1.size() - 1){
    		flag = 0;
    	}
    	if(flag){
    		res1++;
    	}
    }
    
    flag = 1;
    i64 num1 = 0;
    i64 num2 = 0;
    for(int i = 0; i < g1.size(); i++){
    	x = g1[i];
    	if(deg[x] == g1.size() - 1){
    		flag = 2;
    		num1++;
    	}
    	if(deg[x] == g1.size()){
    		num2++;
    	}
    }
    if(flag == 1){
    	res2 = num2 + 1;
    }
    else{
    	res2 = num1;
    }
    
    cout << res1 << ' ' << res2 << endl;
    return;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

	long long tt = 1;
	cin >> tt;
	while(tt--){
		solve();
	}

    return 0;
}