#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
int deg[mxN];
int idx[mxN];
vector<int> adj[mxN];

bool cmp(int x, int y) {
    return deg[x] > deg[y];
}
 
void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
        deg[u]++, deg[v]++;
    }

    sort(deg + 1, deg + 1 + n);
    reverse(deg + 1, deg + 1 + n);

    int resA = 1, resB = 1;
    int maxClique = 1; 
    for(int i = 1; i <= n; i++) {
        if(deg[i] >= i - 1) {
            maximize(maxClique, i);
        }        
    }

    for(int i = maxClique + 1; i <= n; i++) {
        if(deg[i] >= maxClique - 1) {
            resA++;
        }
    }

    int cnt = 0;
    for(int i = 1; i <= maxClique; i++) {
        if(deg[i] == maxClique - 1) {
            ++cnt;
        }
    }

    if(cnt > 0) {
        cout << resA << " " << cnt << endl;
    }
    else {
        for(int i = 1; i <= maxClique; i++) {
            if(deg[i] == maxClique) ++cnt;
        }
        cout << resA << " " << cnt + 1 << endl;
    }
    for(int i = 1; i <= n; i++) {
        adj[i].clear();
        deg[i] = 0;
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen(TASK".inp" , "r" , stdin);
    // freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}