#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

void solve(){
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> edges;
  vector<int> order(n), deg(n + 1);
  while (m--){
    int x, y;
    cin >> x >> y;
    edges.pb({x, y});
    edges.pb({y, x});
    deg[x]++, deg[y]++;
  }
  sort(all(edges));
  iota(all(order), 1);
  sort(all(order), [&] (int i, int j){
    return deg[i] > deg[j];
  });
  int sz = 0;
  while (sz < n){
    int v = order[sz];
    bool good = 1;
    for (int i = 0; i < sz; i++) good &= binary_search(all(edges), pair{order[i], v});
    if (!good) break;
    sz++;
  }
  int x = 1, y = 0;
  for (int i = 0; i < n; i++){
    int v = order[i];
    if (i < sz) y += (deg[v] == sz - 1);
    else x += (deg[v] == sz - 1);
  }
  if (!y){
    y = 1;
    for (int i = 0; i < sz; i++){
      int v = order[i];
      y += (deg[v] == sz);
    }
  }

  cout << x << " " << y << endl;
}

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