#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

void solve() {
    int n = read(), m = read();
    vector<int> deg(n + 1);
    while (m--) {
        int a = read(), b = read();
        ++deg[a], ++deg[b];
    }
    sort(deg.begin() + 1, deg.end(), greater<int>());
    int p = n;
    for (int i = 1; i <= n; ++i) {
        if (deg[i] < i - 1) {
            p = i - 1;
            break;
        }
    }
    // cout << p << el;
    int ans1 = 1, ans2 = 0;
    for (int i = p + 1; i <= n; ++i) ans1 += deg[i] == p - 1;
    for (int i = 1; i <= p; ++i) ans2 += deg[i] == p - 1;
    if (!ans2) {
        ans2 = 1;
        for (int i = 1; i <= p; ++i) ans2 += deg[i] == p;
    }
    printf("%d %d\n", ans1, ans2);
}

int main() {
    // ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}