#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MAXN = 1e5 + 100;
vector<int> g[MAXN];

int ind[MAXN];

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        g[i].clear();
    }
    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);
    }
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [](int i, int j) { return g[i].size() < g[j].size(); });
    for (int i = 0; i < n; ++i) {
        ind[ord[i]] = i;
    }
    int sz = 0;
    for (int i = 0; i < n; ++i) {
        bool f = true;
        for (int u : g[ord[i]]) {
            if (ind[u] < i) {
                f = false;
                break;
            }
        }
        if (!f) break;
        ++sz;
    }
    int cnt0 = 0, cnt1 = 0;
    for (int i = 0; i < sz; ++i) {
        int cur = 0;
        for (int u : g[ord[i]]) {
            if (ind[u] >= sz) {
                ++cur;
            }
        }
        if (cur == n - sz) {
            cnt0++;
        } else if (cur == n - sz - 1) {
            cnt1++;
        }
    }
    if (cnt0 != 0) {
        cout << cnt0 << " ";
    } else {
        cout << cnt1 + 1 << " ";
    }
    cnt0 = 0, cnt1 = 0;
    for (int i = sz; i < n; ++i) {
        int cur = 0;
        for (int u : g[ord[i]]) {
            if (ind[u] < sz) {
                ++cur;
            }
        }
        if (cur == 0) {
            cnt0++;
        } else if (cur == 1) {
            cnt1++;
        }
    }
    if (cnt0 != 0) {
        cout << cnt0 << "\n";
    } else {
        cout << cnt1 + 1 << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }

    return 0;
}