#include<bits/stdc++.h>

#define ll long long
#define db double
#define vc vector
#define pb emplace_back
#define pii pair<int,int>
#define mkp make_pair
#define mem(a) memset(a,0,sizeof(a))

//#define int long long

using namespace std;
const int N = 1e6+5, P = 998244353;
const int inf = 0x3f3f3f3f;
//const ll inf = 0x3f3f3f3f3f3f3f3f;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch=='-'), ch = getchar();
	while(isdigit(ch)) x = x*10+(ch^48), ch = getchar(); return w?-x:x;
}
inline void write(int x) { if(x<0) putchar('-'), x = -x; if(x>9) write(x/10); putchar(x%10+'0'); }
inline void writec(int x) { write(x); putchar(32); }
inline void writee(int x) { write(x); putchar(10); }

inline void inc(int &x,int y) { x += y-P; x += (x>>31)&P; }
inline void dec(int &x,int y) { x -= y; x += (x>>31)&P; }
inline int pls(int x,int y) { x += y-P; x += (x>>31)&P; return x; }
inline void Max(int &x,int y) { if(x<y) x = y; }
inline void Min(int &x,int y) { if(x>y) x = y; }
inline int power(int a,int b) { int res = 1; for(;b;b>>=1,a=1ll*a*a%P) if(b&1) res = 1ll*res*a%P; return res; }

int n, m, cnt, o[N];
bool vis[N];
pii e[N];
vc<int> G[N];

int TIME;

inline void solve() {
	n = read(); m = read(); ++TIME;
	for(int i=1;i<=n;i++) vis[i] = 0, G[i].clear(), o[i] = i;
	for(int i=1,x,y;i<=m;i++) x = read(), y = read(), G[x].pb(y), G[y].pb(x), e[i] = mkp(x,y);
	sort(o+1,o+1+n,[&](int A,int B){return G[A].size()>G[B].size();});
	int cnt1 = 0, cnt2 = 0, cnt3 = 0; cnt = 0;
	for(int i=1;i<=n;i++) {
		int x = o[i], res = 0;
		for(auto y:G[x]) res += vis[y];
		if(res==cnt) ++cnt, vis[x] = 1;
	}
	for(int i=1;i<=n;i++) if(!vis[i]) assert(G[i].size()<cnt);
	for(int i=1;i<=n;i++) if(vis[i]==1) {
		if(G[i].size()==cnt) ++cnt3;
		else if(G[i].size()==cnt-1) ++cnt1;
	}
	for(int i=1;i<=n;i++) if(vis[i]!=1 && G[i].size()==cnt-1) ++cnt2;
	if(cnt1) cout<<1+cnt2<<" "<<cnt1<<endl;
	else cout<<1+cnt2<<" "<<1+cnt3<<endl;
}

signed main() {
	int t = read(); while(t--)  solve();
	return 0;
}