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

const int maxn=100000;
int n,m;
int deg[maxn+50];
vector<int> g[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	for (;T--;){
		cin >> n >> m;
		for (int i=1;i<=m;i++){
			int x,y;
			cin >> x >> y;
			g[x].push_back(y);
			g[y].push_back(x);
			deg[x]++;
			deg[y]++;
		}
		int ans1=0,ans2=0;
		{
			vector<int> ok(n+5);
			vector<int> order(n+5);
			for (int i=1;i<=n;i++) order[i]=i;
			sort(order.begin()+1,order.begin()+n+1,
				[&](int x,int y){
					return deg[x]>deg[y];	
				}
			);
			int okcnt=0;
			for (int i=1;i<=n;i++){
				int u=order[i];
				int cnt=0;
				for (auto v:g[u]) if (ok[v]) cnt++;
			//	cout << "u,cnt : " << u << " " << cnt << endl;
				if (cnt!=okcnt) continue;
				ok[u]=1;
				okcnt++;
			}
			int ans=1;
			for (int i=1;i<=n;i++) if (!ok[i]){
				int cnt=0;
				for (auto v:g[i]) if (ok[v]) cnt++;
				if (cnt==okcnt-1) ans++;
			}
			ans1=ans;
		//	cout << "okcnt : " << okcnt << endl;
		//	for (int i=1;i<=n;i++) cout << ok[i] << " ";
		//	cout << endl;
		}
		{
			vector<int> ok(n+5);
			vector<int> order(n+5);
			for (int i=1;i<=n;i++) order[i]=i;
			sort(order.begin()+1,order.begin()+n+1,
				[&](int x,int y){
					return deg[x]<deg[y];	
				}
			);
			int okcnt=0;
			for (int i=1;i<=n;i++){
				int u=order[i];
				int cnt=okcnt;
				for (auto v:g[u]) if (ok[v]) cnt--;
				if (cnt!=okcnt) continue;
				ok[u]=1;
				okcnt++;
			}
			int ans=1;
			for (int i=1;i<=n;i++) if (!ok[i]){
				int cnt=okcnt;
				for (auto v:g[i]) if (ok[v]) cnt--;
				if (cnt==okcnt-1) ans++;
			}
			ans2=ans;
		}
	//	cout << "--- :: ";
		cout << ans1 << " " << ans2 << "\n";
		for (int i=1;i<=n;i++){
			g[i].clear();
			deg[i]=0;	
		}
	}
	return 0;	
}