#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--) {
        int n,m;
        cin >> n >> m;
        vector<pair<int,int>> cnt(n);
        for (int i = 0; i < n; ++i) {
            cnt[i].second = i;
        }
        vector<vector<int>> g(n);
        for(int i = 0; i < m; i++) {
            int a,b;
            cin >> a >> b;
            a--;
            b--;
            cnt[a].first++;
            cnt[b].first++;
            g[a].push_back(b);
            g[b].push_back(a);
        }
        sort(cnt.begin(),cnt.end());
        int s = 1;
        for(int i = 0; i < n; i++) {
            int a = n-i;
            s = max(s,min(a,cnt[i].first+1));
        }
        vector<bool> cli(n);
        for (int i = 0; i < s; ++i) {
            cli[cnt[n-1-i].second] = true;
        }
        vector<int> deg(n);
        int res1 = 1;
        for (int i = 0; i < n; ++i) {
            if (!cli[i]) {
                if (g[i].size() == s-1) res1 += 1;
                for (int j : g[i]) {
                    deg[j] += 1;
                }
            }
        }
        int res2 = 0;
        for (int i = 0; i < n; ++i) {
            if (cli[i] and deg[i] == 0) {
                res2 += 1;
            }
        }
        if (res2 == 0) {
            res2 += 1;
            for (int i = 0; i < n; ++i) {
                if (cli[i] and deg[i] == 1) res2 += 1;
            }
        }
        cout << res1 << " " << res2 << "\n";
    }
}