#include <bits/stdc++.h>
#define ii pair <int, int>
#define F first
#define S second

using namespace std;

const int mod = 1e9 + 7;
const int N = 1e5 + 5;

int n, m, deg[N];
vector <int> c[N];
int sr[N];

void solve(){
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i) deg[i] = 0, c[i].clear();
    for (int i = 1; i <= m; ++ i){
        int u, v; cin >> u >> v;
        c[u].push_back(v);
        c[v].push_back(u);
        deg[u] ++;
        deg[v] ++;
    }
    for (int i = 1; i <= n; ++ i) {
        sr[i] = i;
    }
    sort(sr + 1, sr + n + 1, [&](int u, int v) {
        return deg[u] > deg[v];
    });

    int cnt = 0;
    int ans = 0;
    int gg = 1;
    for (int i = n; i >= 1; -- i){
        if (deg[sr[i]] >= i - 1){
            for (int j = i + 1; j <= n; ++ j) if (deg[sr[j]] == i - 1) ++ cnt;
            for (int j = 1; j <= i; ++ j) if (deg[sr[j]] == i - 1) ++ ans;
            for (int j = 1; j <= i; ++ j) if (deg[sr[j]] == i) ++ gg;
            break;
        }
    }

    if (ans == 0) ans = gg;
    cout << cnt + 1 << ' ' << ans << '\n';


}

int main(){
    //freopen("code.inp", "r", stdin);
    //freopen("code.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t;
    while (t --) solve();

    return 0;
}