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

const int N=1e5+5;

int _,n,m;
int deg[N];
bool vis[N];

bool cmp(int x,int y){return deg[x]>deg[y];}

int main()
{
	scanf("%d",&_);
	while(_--)
	{
		memset(deg,0,sizeof deg);
		memset(vis,0,sizeof vis);
		scanf("%d%d",&n,&m);
		if(!m){cout<<n<<' '<<1<<'\n';continue;}
		for(int i=1;i<=m;i++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			deg[x]++,deg[y]++;
		}
		vector<int> vt;
		for(int i=1;i<=n;i++)vt.push_back(i);
		sort(vt.begin(),vt.end(),cmp);
		int maxsz=0;
		for(int x:vt)
		{
			if(deg[x]>=maxsz)maxsz++,vis[x]=1;
			else break;
		}
		int ans=1;
		for(int i=1;i<=n;i++)
			if(!vis[i]&&deg[i]==maxsz-1)
				ans++;
		cout<<ans<<' ';
		int t1=0,t2=1;
		for(int i=1;i<=n;i++)if(vis[i])
		{
			if(deg[i]==maxsz-1)t1++;
			else if(deg[i]==maxsz)t2++;
		}
		if(t1)cout<<t1;
		else cout<<t2;
		cout<<'\n';
	}
	return 0;
}