#include <bits/stdc++.h>
#define MAXN 100005  
#define For(I,A,B) for(int I = A, endi = B; I <= endi; ++I)
#define foR(I,A,B) for(int I = A, endi = B; I >= endi; --I)
using namespace std;
typedef long long _ll;

int T,n,m,u,v,ans1,res,ans2,cnt,d[MAXN],f[MAXN],pos[MAXN];
inline bool cmp(int a,int b){return d[a] > d[b];}
void solve()
{
    cin >> n >> m; ans1 = 1; res = 0; ans2 = 1; cnt = 0;
    if(!m) { cout << n << " 1\n"; return; }
    For(i,1,n) d[i] = f[i] = 0, pos[i] = i;
    For(i,1,m) cin >> u >> v, ++d[u], ++d[v];
    sort(pos+1,pos+n+1,cmp);
    For(i,1,n)
    {
        u = pos[i];
        if(d[u] >= cnt) ++cnt, f[u] = 1;
        else break; 
    }
    For(i,1,n) if(!f[i] && d[i] == cnt-1) ++ans1;
    For(i,1,n) if(f[i])
    {
        if(d[i] == cnt-1) ++res;
        else if(d[i] == cnt) ++ans2;
    }
    if(res) ans2 = res;
    cout << ans1 << " " << ans2 << "\n";
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> T;
    while(T--) solve();
    return 0;
}