#include <set>
#include <vector>
#include <numeric>
#include <iostream>
#include <algorithm>
using namespace std;

struct edge {
	int t, id;
};

vector<vector<int> > biconnected(int N, int M, const vector<vector<edge> >& G) {
	vector<bool> vis(N, false);
	vector<int> depth(N);
	vector<edge> par(N, edge{-1, -1});
	vector<int> low(N);
	vector<vector<int> > ans;
	vector<edge> st;
	auto dfs = [&](auto& self, int x) -> void {
		vis[x] = true;
		low[x] = depth[x];
		for (edge e : G[x]) {
			if (!vis[e.t]) {
				depth[e.t] = depth[x] + 1;
				par[e.t] = edge{x, e.id};
				st.push_back(e);
				self(self, e.t);
				low[x] = min(low[x], low[e.t]);
				if (low[e.t] >= depth[x]) {
					ans.push_back(vector<int>());
					while (st.back().id != e.id) {
						ans.back().push_back(st.back().id);
						st.pop_back();
					}
					ans.back().push_back(e.id);
					st.pop_back();
				}
			} else if (depth[e.t] < depth[x] && e.id != par[x].id) {
				st.push_back(e);
				low[x] = min(low[x], depth[e.t]);
			}
		}
	};
	dfs(dfs, 0);
	return ans;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int T;
	cin >> T;
	for (int id = 1; id <= T; id++) {
		int N, M;
		cin >> N >> M;
		vector<vector<edge> > G(N);
		vector<int> A(M), B(M);
		for (int i = 0; i < M; i++) {
			cin >> A[i] >> B[i];
			A[i]--; B[i]--;
			G[A[i]].push_back(edge{B[i], i});
			G[B[i]].push_back(edge{A[i], i});
		}
		vector<vector<int> > ans = biconnected(N, M, G);
		vector<int> c(N);
		for (int i = 0; i < ans.size(); i++) {
			set<int> s;
			for (int j : ans[i]) {
				s.insert(A[j]);
				s.insert(B[j]);
			}
			for (int j : s) {
				c[j]++;
			}
		}
		int ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0;
		for (int i = 0; i < N; i++) {
			ans1 += int(c[i] >= 2);
		}
		for (int i = 0; i < ans.size(); i++) {
			ans2 += int(ans[i].size() == 1);
			ans3 += 1;
			ans4 = max(ans4, int(ans[i].size()));
		}
		cout << ans1 << ' ' << ans2 << ' ' << ans3 / gcd(ans3, ans4) << ' ' << ans4 / gcd(ans3, ans4) << endl;
	}
	return 0;
}