#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
constexpr int max_n = 500;
double eps = 1e-8;

struct Color {
  double r, g, b;
  Color operator-(const Color& other) const { return {r - other.r, g - other.g, b - other.b}; }
  Color operator/(const double k) const { return {r / k, g / k, b / k}; }
  Color operator*(const double k) const { return {r * k, g * k, b * k}; }
  double len2() const { return r*r + g*g + b*b; }
  double len() const { return sqrt(len2()); }
};

vector<pair<array<int, 3>, double>> ans;

void solve() {
  ans.clear();
  Color target;
  cin >> target.r >> target.g >> target.b;
  int d[3] = {0, 1, 2};
  if (target.r > target.g) {
    swap(target.r, target.g);
    swap(d[0], d[1]);
  }
  if (target.r > target.b) {
    swap(target.r, target.b);
    swap(d[0], d[2]);
  }
  if (target.g > target.b) {
    swap(target.g, target.b);
    swap(d[1], d[2]);
  }
  Color v = Color{255, 255, 255} - target;
  if (target.r == 255) ans.emplace_back(array<int,3>{255,255,255},1000);
  else {
    Color nt = {0, 255 - v.g/v.r * 255, 255 - v.b/v.r * 255};
    ans.emplace_back(array<int,3>{255,255,255},(target - nt).len());
    target = nt;
  }
  if (target.g == 255) ans.emplace_back(array<int,3>{0, 255, 255}, 1000);
  else {
    Color nt = {0, 0, 255 - v.b/v.g * 255};
    ans.emplace_back(array<int,3>{0,255,255},(target - nt).len());
    target = nt;
  }
  if (target.b == 255) ans.emplace_back(array<int,3>{0, 0, 255}, 1000);
  else {
    Color nt = {0, 0, 0};
    ans.emplace_back(array<int,3>{0,0,255},(target - nt).len());
    target = nt;
  }
  int n = ans.size();
  cout << n << '\n';
  for (int i = n - 1; i >= 0; --i) {
    for (int j = 0; j < 3; ++j) {
      cout << ans[i].first[d[j]] << ' ';
    }
    cout << setprecision(12) << ans[i].second << '\n';
  }
}

int main() {
//  freopen("code.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
//    scanf("%d", &T);
    for (int i = 1; i <= T; ++i) {
        // cout << "Case " << i << ": ";
        solve();
    }
    return 0;
}

/*
3 3
2.4.2
.....
4.8.4
.....
2.5.3

5 5
3.4.4.4.2
.........
4.7.7.7.4
.........
4.8.7.7.4
.........
4.7.7.7.5
.........
2.4.4.4.2
*/