#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define ll long long
using namespace std;
const int N=1007;
int n,f[N],s[N];
struct node{
	int x,y,r;
}p[N];
int find(int x)
{
	if(x==f[x]) return x;
	int u=find(f[x]);s[x]^=s[f[x]];
	return f[x]=u;
}
void work()
{
	scanf("%d",&n);
	fo(i,1,n) scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].r);
	fo(i,1,n) f[i]=i,s[i]=0;
	fo(i,1,n) fo(j,i+1,n) if((p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y)==(p[i].r+p[j].r)*(p[i].r+p[j].r))
	{
		int u=find(i),v=find(j);
		if(u<v) swap(u,v);
		f[u]=v;s[u]=s[i]^s[j]^1;
	}
	fo(i,1,n)
	{
		if(find(i)!=1) printf("not moving\n");
		else
		{
			int u=p[1].r,v=p[i].r,g=__gcd(u,v);u/=g;v/=g;
			if(v==1) printf("%d",u);
			else printf("%d/%d",u,v);
			printf(" %s\n",s[i]==0?"clockwise":"counterclockwise");
		}
	}
}
int main()
{
	int T;scanf("%d",&T);
	while(T--) work();
}