#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


using Double = long double;

constexpr Double EPS = 1e-10L;
constexpr Double L = 255;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    vector<Double> A(3);
    for (int i = 0; i < 3; ++i) {
      int x;
      scanf("%d", &x);
      A[i] = x;
    }
    
    vector<vector<Double>> ans;
    auto bs = A;
    for (int p = 7; p; ) {
      int im = -1;
      for (int i = 0; i < 3; ++i) if (p >> i & 1) {
        if (!~im || bs[im] > bs[i]) {
          im = i;
        }
      }
      if (bs[im] == L) {
        vector<Double> op(4, 0.0);
        Double d = 0.0;
        for (int i = 0; i < 3; ++i) if (p >> i & 1) {
          op[i] = L;
          d += L * L;
        }
        op[3] = sqrt(d);
        ans.push_back(op);
        break;
      } else {
        vector<Double> op(4, 0.0);
        Double d = 0.0;
        auto cs = bs;
        for (int i = 0; i < 3; ++i) if (p >> i & 1) {
          op[i] = L;
          cs[i] = L - (L - 0) / (L - bs[im]) * (L - bs[i]);
          d += (cs[i] - bs[i]) * (cs[i] - bs[i]);
        }
        op[3] = sqrt(d);
        ans.push_back(op);
        bs = cs;
        p -= (1 << im);
      }
    }
    reverse(ans.begin(), ans.end());
    
    printf("%d\n", (int)ans.size());
    for (const auto &op : ans) {
      printf("%.Lf %.Lf %.Lf %.12Lf\n", op[0], op[1], op[2], op[3]);
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}