#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 101010

int n,m;
vector<int>V[sz];

void work() {
    cin>>n>>m;
    int x,y;
    rep(_,1,m) cin>>x>>y,V[x].push_back(y),V[y].push_back(x);
    static int id[sz]; rep(i,1,n) id[i]=i;
    sort(id+1,id+n+1,[](int x,int y){return V[x].size()>V[y].size();});
    set<int>S;
    rep(i,1,n) {
        int cnt=0;
        for (auto t:V[id[i]]) if (S.count(t)) ++cnt;
        if (cnt==(int)S.size()) S.insert(id[i]);
    }
    int ans1=1;
    rep(i,1,n) if (!S.count(i)) {
        int cnt=0;
        for (auto t:V[i]) if (S.count(t)) ++cnt;
        if (cnt==(int)S.size()-1) ++ans1;
    }
    cout<<ans1<<' ';
    set<int>T;
    rep(i,1,n) if (!S.count(i)) T.insert(i);
    rep(i,1,n) if (S.count(i)&&V[i].size()==S.size()-1) {
        T.insert(i);
        S.erase(i);
        break;
    }
    int ans2=1;
    for (auto x:S) if (V[x].size()==S.size()) ++ans2;
    cout<<ans2<<'\n';
    rep(i,1,n) V[i].clear();
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int T; cin>>T;
    while (T--) work();
    return 0;
}