#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

    auto solve = [&]() {
        int n, m;
        cin >> n >> m;

        vector<vector<int>> adj(n);
        for (int i = 0; i < m; i++) {
            int u, v;
            cin >> u >> v;
            u--, v--;
            adj[u].push_back(v);
            adj[v].push_back(u);
        }

        vector<int> o(n);
        iota(o.begin(), o.end(), 0);
        sort(o.begin(), o.end(), [&](int i, int j) {
            return adj[i].size() > adj[j].size();
        });

        vector<int> side(n);
        int clique = 0;

        for (auto u : o) {
            int cnt = count_if(adj[u].begin(), adj[u].end(), [&](int v) {
                return side[v];
            });
            if (cnt == clique) {
                clique++;
                side[u] = 1;
            }
        }

        int ans1 = 1, ans2 = 1;

        for (int i = 0; i < n; i++) {
            if (side[i] == 0 && adj[i].size() == clique - 1) {
                ans1++;
            }
        }

        for (int i = 0; i < n; i++) {
            if (side[i] == 1 && adj[i].size() == clique - 1) {
                side[i] = 0;
                clique--;
            }
        }

        for (int i = 0; i < n; i++) {
            if (side[i] == 1 && adj[i].size() == clique) {
                ans2++;
            }
        }

        cout << ans1 << ' ' << ans2 << '\n';        
    };
    
    while (t--) {
        solve();
    }
    
    return 0;
}