#include <cstdio>
#include <iomanip>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#define x first
#define y second
#define point vec
#define eps (1e-4)
#define mp std::make_pair
#define pb push_back
#define db double
#define ld long double
using std::string;
using std::pair;
using std::abs;
using std::sqrt;
using std::max;
using std::vector;
const int L=255;

int T, stk[100], top;
ld x, y, z, nx, ny, nz, d[100];
inline ld sq(ld x) { return (ld)x*x; }
inline ld dis(ld a, ld b, ld c)
{
	return sqrt(sq(a-x)+sq(b-y)+sq(c-z));
}
int main()
{
	scanf("%d", &T);
	while(T--)
	{
		scanf("%Lf%Lf%Lf", &x, &y, &z);
		top=0;
		int a=(x*2>L), b=(y*2>L), c=(z*2<L);
		stk[++top]=a|(b<<1)|(c<<2);
		ld k=(c?z/(L-z):(L-z)/z);
		// printf("k %Lf %d\n", k, c);
		nx=k*(x-a*L)+x, ny=k*(y-b*L)+y, nz=(c?0:L);
		d[top]=dis(nx, ny, nz);
		x=nx, y=ny, z=nz;
		c^=1;
		// printf("now %Lf %Lf %Lf %d\n", x, y, z, c);
		stk[++top]=3|(c<<2);
		if(abs(nx-L)>eps||abs(ny-L)>eps)
		{
			if(x<y)
			{
				nx=0, ny=L-(L-y)*(L/(L-x));
			}
			else
			{
				ny=0, nx=L-(L-x)*(L/(L-y));
			}
			d[top]=dis(nx, ny, nz);
			x=nx, y=ny;
		}
		else
		{
			d[top]=L;
			x=0, y=L;
		}
		// printf("now %Lf %Lf %Lf\n", x, y, z);
		if(abs(x)<eps)
		{
			stk[++top]=2|(c<<2);
			d[top]=y;
			y=0;
		}
		else
		{
			stk[++top]=1|(c<<2);
			d[top]=x;
			x=0;
		}
		if(z>1) stk[++top]=4, d[top]=z, z=0;
		printf("%d\n", top);
		for(int i=top; i; --i) printf("%d %d %d %.6Lf\n", L*(stk[i]&1), L*((stk[i]>>1)&1), L*((stk[i]>>2)&1), d[i]);
		// x=0, y=0, z=0;
		// for(int i=top; i; --i)
		// {
		// 	int a=L*(stk[i]&1), b=L*((stk[i]>>1)&1), c=L*((stk[i]>>2)&1);
		// 	ld cd=dis(a, b, c);
		// 	ld rd=std::min(d[i], cd);
		// 	if(cd<eps) continue;
		// 	x+=(a-x)*rd/cd, y+=(b-y)*rd/cd, z+=(c-z)*rd/cd;
		// printf("ok %Lf %Lf %Lf\n", x, y, z);
		// }
		// printf("final %.6Lf %.6Lf %.6Lf\n", x, y, z);
	}
	return 0;
}