#pragma GCC optimize("Ofast,inline,no-stack-protector,unroll-loops")
#include<algorithm>
#include<iostream>
#include<numeric>
#include<vector>
int e[1000001],deg[1000001];
int main()
{
	std::cin.tie(nullptr)->sync_with_stdio(0);
	int t;
	std::cin>>t;
	while(t--)
	{
		int n,m;
		std::cin>>n>>m,std::fill_n(deg,n,0),std::iota(e,e+n,0);
		while(m--)
		{
			int a,b;
			std::cin>>a>>b,deg[a-1]++,deg[b-1]++;
		}
		std::sort(e,e+n,[](int x,int y){return deg[x]>deg[y];});
		int x=0;
		for(;deg[e[x]]>=x;x++);
		int ans[2]{1+std::count_if(e+x,e+n,[=](int y){return deg[y]==x-1;}),std::count_if(e,e+x,[=](int y){return deg[y]==x-1;})};
		if(!ans[1])
			ans[1]=1+std::count_if(e,e+x,[=](int y){return deg[y]==x;});
		std::cout<<ans[0]<<' '<<ans[1]<<'\n';
	}
	return 0;
}