uva10859

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1007,MOD = 2000;
vector<int> edge[maxn];
int vis[maxn][2], d[maxn][2], n, m;

int dp(int cur, int flag, int fa) {
    
	if (vis[cur][flag]) return d[cur][flag];

	vis[cur][flag] = 1;

	int &ans = d[cur][flag];
	ans = MOD;
	for (int i = 0; i < edge[cur].size(); i++) {
    
		int nx = edge[cur][i];
		if (nx == fa)continue;
		ans += dp(nx,1,cur);
	}

	if (!flag && fa != -1) ++ans;

	if (flag || fa == -1) {
    
		int sum = 0;
		for (int i = 0; i < edge[cur].size(); i++) {
    
			int nx = edge[cur][i];
			if (nx == fa) continue;
			sum += dp(nx, 0, cur);
		}
		if (fa != -1) sum++;
		ans = min(ans, sum);
	}
	return ans;
}
int main()
{
    
	int t,a,b;
	cin >> t;
	while (t--) {
    
		cin >> n >> m;
		for (int i = 0; i < n; i++) edge[i].clear();

		for (int i = 0; i < m; i++) {
    
			cin >> a >> b;
			edge[a].push_back(b);
			edge[b].push_back(a);
		}
		memset(vis, 0, sizeof(vis));
		int ans = 0;
		for (int i = 0; i < n; i++) {
    
			if (!vis[i][0]) {
    
				ans += dp(i, 0, -1);
			}
		}
		cout << ans / MOD << " " << m - ans % MOD << " " << ans % MOD << endl;
	}
	return 0;
}