#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;
    
    std::vector<std::vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        std::cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    std::vector<int> p(n);
    std::iota(p.begin(), p.end(), 0);
    std::sort(p.begin(), p.end(),
        [&](int i, int j) {
            return adj[i].size() > adj[j].size();
        });
    
    std::vector<int> vis(n);
    int cnt = 0;
    for (auto x : p) {
        int res = 0;
        for (auto y : adj[x]) {
            res += vis[y];
        }
        if (cnt == res) {
            vis[x] = 1;
            cnt++;
        }
    }
    for (int x = 0; x < n; x++) {
        for (auto y : adj[x]) {
            assert(vis[x] || vis[y]);
        }
    }
    int ans1 = 1;
    int ans2 = 1;
    for (int i = 0; i < n; i++) {
        if (!vis[i] && adj[i].size() == cnt) {
            assert(false);
        }
        if (!vis[i] && adj[i].size() == cnt - 1) {
            ans1++;
        }
    }
    int num = 0; 
    for (int i = 0; i < n; i++) {
        if (vis[i] && adj[i].size() == cnt - 1) {
            cnt--;
            ++num;
            vis[i] = 0;
        }
    }
    assert(num <= 1);
    for (int i = 0; i < n; i++) {
        if (vis[i] && adj[i].size() == cnt) {
            ans2++;
        }
    }
    std::cout << ans1 << " " << ans2 << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}