#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<int>cnt(n),res;
        vector<vector<int>>road(n);
        for(int i = 0; i < m; i++) {
            int a,b;
            cin >> a >> b;
            a--;
            b--;
            road[a].push_back(b);
            road[b].push_back(a);
            cnt[a]++;
            cnt[b]++;
        }
        res = cnt;
        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]+1));
        }
        int a = 0,b = 0,c = 0;
        for(int i = 0; i < n; i++) {
            if(cnt[i] == s-1) {
                a++;
            }
            if(cnt[i] == s) {
                c++;
            }
            if(cnt[i] > s) {
                b++;
            }
        }
        if(m == 0) {
            cout << n << " " << 1 << endl;
        }
        else if(b+c == 0) {
            cout << 1 << " " << a << endl;
        }
        else if(b+c == s) {
            cout << a+b+c-s+1 << " " << c+1 << endl;
        }
        else {
            cout << a+b+c-s+1 << " " << s-b-c << endl;
        }
    }
}