#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <unordered_set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = (int)1e9 + 7;

using namespace std;

unordered_set<int> gph[101010];
int deg[101010];
bool R[101010];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while(T--)
	{
		int n, m; cin >> n >> m;
		for(int i = 0; i < n; ++i) gph[i].clear(), deg[i] = 0, R[i] = false;
		for(int i = 0; i < m; ++i)
		{
			int x, y; cin >> x >> y; --x; --y;
			gph[x].insert(y);
			gph[y].insert(x);
		}

		int A[n]; iota(A, A + n, 0);
		sort(A, A + n, [&](int x, int y){ return gph[x].size() > gph[y].size(); });

		vector<int> V;
		for(auto i : A)
		{
			bool flag = true;
			for(auto j : V)
			{
				if(!gph[i].count(j))
				{
					flag = false;
					break;
				}
			}
			if(!flag) break;
			V.push_back(i);
			R[i] = true;
		}
		vector<int> W;
		for(int i = 0; i < n; ++i) if(!R[i]) W.push_back(i);

		for(auto i : V) for(auto j : gph[i]) if(!R[j]) ++deg[j];
		for(auto i : W) for(auto j : gph[i]) if(R[j]) ++deg[j];

		int cnt = 0;
		for(auto i : W) if(deg[i] == (int)V.size()) ++cnt;
		if(cnt) cout << cnt << ' ';
		else
		{
			cnt = 1;
			for(auto i : W) if(deg[i] == (int)V.size() - 1) ++cnt;
			cout << cnt << ' ';
		}
		cnt = 0;

		for(auto i : V) if(deg[i] == 0) ++cnt;
		if(cnt) cout << cnt << '\n';
		else
		{
			cnt = 1;
			for(auto i : V) if(deg[i] == 1) ++cnt;
			cout << cnt << '\n';
		}
	}
}