#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e4+5,M=N*4+5,K=1000+5,mod=1e8+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m;
int to[20][N],cntmch[N],cntgame[N],mp[N],gp[N];
int len[20],vis[N];
using frac=pair<ll,ll>;
frac operator +(const frac &A,const frac &B){
	ll g=__gcd(A.se,B.se);
	return make_pair(B.se/g*A.fi+A.se/g*B.fi,B.se*A.se/g);
}
frac mwp[N],gwp[N],omw[N],ogw[N];
void print(frac x,char c){
	ll g=__gcd(x.fi,x.se);
	printf("%lld/%lld%c",x.fi/g,x.se/g,c);
}
void Solve(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		cntmch[i]=cntgame[i]=mp[i]=gp[i]=0;
	}
	for(int i=1;i<=m;i++) scanf("%d",&len[i]);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++) vis[j]=0;
		while(len[i]--){
			int x,y,w1,w2,d;
			scanf("%d%d%d%d%d",&x,&y,&w1,&w2,&d);
			vis[x]=vis[y]=1;
			to[i][x]=y;to[i][y]=x;
			if(w1==w2) mp[x]++,mp[y]++;
			else if(w1>w2) mp[x]+=3;
			else mp[y]+=3;
			gp[x]+=w1*3+d;
			gp[y]+=w2*3+d;
			cntgame[x]+=w1+w2+d;
			cntgame[y]+=w1+w2+d;
		}
		for(int j=1;j<=n;j++){
			if(!vis[j]){
				to[i][j]=-1;
				mp[j]+=3;gp[j]+=6;
				cntgame[j]+=2;
			}else{
				cntmch[j]++;
			}
		}
		for(int j=1;j<=n;j++){
			mwp[j]=frac(mp[j],3*i),gwp[j]=frac(gp[j],3*cntgame[j]);
			if(mwp[j].fi*3<=mwp[j].se) mwp[j]=frac(1,3);
			if(gwp[j].fi*3<=gwp[j].se) gwp[j]=frac(1,3);
		}
		for(int j=1;j<=n;j++){
			omw[j]=ogw[j]=frac(0,1);
			for(int h=1;h<=i;h++) if(~to[h][j]) omw[j]=omw[j]+mwp[to[h][j]],ogw[j]=ogw[j]+gwp[to[h][j]];
			if(!cntmch[j]) omw[j]=frac(1,3),ogw[j]=frac(1,3);
			else omw[j].se*=cntmch[j],ogw[j].se*=cntmch[j];
		}
		printf("Round %d\n",i);
		for(int j=1;j<=n;j++){
			printf("%d ",mp[j]);
			print(omw[j],' ');
			print(gwp[j],' ');
			print(ogw[j],'\n');
		}
	}
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}