#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;

int n,m;
int deg[N],p[N];
bool flag[N];

void solve(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<=n;i++)deg[i]=0,flag[i]=0;
    for(int i=1;i<=m;i++){
        int x,y;scanf("%d%d",&x,&y);
        deg[x]++,deg[y]++;
    }
    if(m==0)printf("%d 1\n",n);
    iota(p+1,p+n+1,1);
    sort(p+1,p+n+1,[&](int x,int y){
        return deg[x]>deg[y];
    });
    int sz=0;
    for(int i=1;i<=n;i++){
        int x=p[i];
        if(deg[x]>=sz)sz++,flag[x]=1;
        else break;
    }
    int ans=1;
    for(int i=1;i<=n;i++){
        if(!flag[i]&&deg[i]==sz-1)ans++;
    }
    printf("%lld ",ans);
    int cnt1=0,cnt2=1;
    for(int i=1;i<=n;i++){
        if(!flag[i])continue;
        if(deg[i]==sz-1)cnt1++;
        if(deg[i]==sz)cnt2++;
    }
    printf("%d\n",cnt1?cnt1:cnt2);
}

int main(){
    int T;scanf("%d",&T);
    while(T--)solve();
    return 0;
}