#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using ll = long long;

const int N = 1e5 + 5;

mt19937 rnd(536465456);

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> g(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    int l = 1, r = n + 1;
    while (r - l > 1) {
        int mid = (r + l) / 2;
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            if (g[i].size() >= mid - 1) {
                cnt++;
            }
        }
        if (cnt >= mid) {
            l = mid;
        } else {
            r = mid;
        }
    }
    vector<int> clica, neclica;
    for (int i = 0; i < n; i++) {
        if (g[i].size() >= l) {
            clica.push_back(i);
        }
    }
    for (int i = 0; i < n; i++) {
        if (clica.size() < l && g[i].size() == l - 1) {
            clica.push_back(i);
        } else if (g[i].size() <= l - 1) {
            neclica.push_back(i);
        }
    }
    int ans2 = 0, ind = -1, ans1 = 0;
    for (int i : clica) {
        if (g[i].size() == l - 1) {
            ans2++;
            ind = i;
        }
    }
    //cout << l << '\n';
    if (ans2 == 0) {
        ans1 = 1, ans2 = 1;
        for (int i : clica) {
//            cout << i << ' ';
            if (g[i].size() <= l) {
                ans2++;
            }
        }
//        cout << '\n';
        for (int i : neclica) {
            //cout << i << ' ';
            if (g[i].size() >= l) {
                ans1++;
            }
        }
//        cout << '\n';
        cout << ans1 << ' ' << ans2 << '\n';
        return;
    }
    neclica.push_back(ind);
    for (int i : neclica) {
        if (g[i].size() == l - 1) {
            ans1++;
        }
    }
    cout << ans1 << ' ' << ans2 << '\n';
}

int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#else
    freopen("input.txt", "r", stdin);
#endif
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}