#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

db dis(db x,db y,db z) {
	return sqrt(x*x+y*y+z*z);
}
void solve() {
	int x,y,z;
	scanf("%d%d%d",&x,&y,&z);
	int fx=0,fy=0,fz=0;
	if (x>127) x=255-x,fx=1;
	if (y>127) y=255-y,fy=1;
	if (z>127) z=255-z,fz=1;
	db scal=255./(255-z);
	vector<pair<array<int,3>,db>> ans;
	ans.pb(mp(array<int,3>{fx,fy,fz},1000.));
	auto solve2=[&](db x, db y) {
		int gx=0,gy=0;
		if (x>=127.5) x=255-x,gx=1;
		if (y>=127.5) y=255-y,gy=1;
		db s2=255./(255-y);
		ans.pb(mp(array<int,3>{1^fx^gx,fy^gy,fz},x*s2));
		ans.pb(mp(array<int,3>{fx^gx,1^fy^gy,fz},dis(x*(s2-1),y,0)));
	};
	solve2(x*scal,y*scal);
	ans.pb(mp(array<int,3>{fx,fy,1^fz},dis(x*(scal-1),y*(scal-1),z)));
	printf("%d\n",SZ(ans));
	for (auto [p,t]:ans) {
		printf("%d %d %d %.10f\n",255*p[0],255*p[1],255*p[2],t);
	}
}

int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		solve();
	}
}