You're given the centers of three equal sides of a strictly convex tetragon. Your task is to restore the initial tetragon.

Input

The first input line contains one number T — amount of tests (1 ≤ T ≤ 5·104). Each of the following T lines contains numbers x1, y1, x2, y2, x3, y3 — coordinates of different points that are the centers of three equal sides (non-negative integer numbers, not exceeding 10).

Output

For each test output two lines. If the required tetragon exists, output in the first line YES, in the second line — four pairs of numbers — coordinates of the polygon's vertices in clockwise or counter-clockwise order. Don't forget, please, that the tetragon should be strictly convex, i.e. no 3 of its points lie on one line. Output numbers with 9 characters after a decimal point.

If the required tetragon doen't exist, output NO in the first line, and leave the second line empty.

Examples

Input

3
1 1 2 2 3 3
0 1 1 0 2 2
9 3 7 9 9 8


Output

NO

YES
3.5 1.5 0.5 2.5 -0.5 -0.5 2.5 0.5
NO
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
int t, i, j, k;
int x[4], y[4];
double fabs(double x) {
  if (x > 0)
    return x;
  else
    return -x;
}
double cross(double x1, double y1, double x2, double y2, double x3, double y3) {
  double u1, v1, u2, v2;
  u1 = x1 - x2;
  v1 = y1 - y2;
  u2 = x3 - x2;
  v2 = y3 - y2;
  return u1 * v2 - u2 * v1;
}
bool meet(double x1, double y1, double x2, double y2, double x3, double y3,
          double x4, double y4) {
  double u1, v1, u2, v2, u3, v3;
  u1 = x1 - x2;
  v1 = y1 - y2;
  u2 = x3 - x2;
  v2 = y3 - y2;
  u3 = x4 - x2;
  v3 = y4 - y2;
  return (u1 * v2 - u2 * v1) * (u1 * v3 - u3 * v1) < eps;
}
bool solve(int a, int b, int c) {
  if ((x[b] - x[a]) * (y[c] - y[a]) - (x[c] - x[a]) * (y[b] - y[a]) == 0)
    return false;
  double a1, a2, b1, b2, c1, c2, x1, x2, y1, y2;
  a1 = 2 * (x[a] - x[b]);
  b1 = 2 * (y[a] - y[b]);
  c1 = x[a] * x[a] + y[a] * y[a] - x[b] * x[b] - y[b] * y[b];
  x2 = 2 * x[b] - x[c];
  y2 = 2 * y[b] - y[c];
  a2 = 2 * (x2 - x[b]);
  b2 = 2 * (y2 - y[b]);
  c2 = x2 * x2 + y2 * y2 - x[b] * x[b] - y[b] * y[b];
  if (fabs(a1) < eps) swap(a1, a2), swap(b1, b2), swap(c1, c2);
  if (fabs(a1) < eps) return false;
  if (fabs(a2) < eps) {
    y1 = c2 / b2;
    x1 = (c1 - b1 * y1) / a1;
    x2 = 2 * x[b] - x1;
    y2 = 2 * y[b] - y1;
  } else {
    if (fabs(b1 / a1 - b2 / a2) < eps && fabs(c1 / a1 - c2 / a2) < eps)
      return false;
    y1 = (c1 - c2 * a1 / a2) / (b1 - b2 * a1 / a2);
    x1 = (c1 - b1 * y1) / a1;
    x2 = 2 * x[b] - x1;
    y2 = 2 * y[b] - y1;
  }
  double x4 = 2 * x[a] - x1, y4 = 2 * y[a] - y1;
  double x3 = 2 * x[c] - x2, y3 = 2 * y[c] - y2;
  if (meet(x[a], y[a], x4, y4, x[c], y[c], x3, y3)) return false;
  if (fabs((x1 - x2) * (y3 - y2) - (x3 - x2) * (y1 - y2)) < eps ||
      fabs((x2 - x3) * (y4 - y3) - (x4 - x3) * (y2 - y3)) < eps ||
      fabs((x3 - x4) * (y1 - y4) - (x1 - x4) * (y3 - y4)) < eps ||
      fabs((x2 - x1) * (y4 - y1) - (x4 - x1) * (y2 - y1)) < eps)
    return false;
  if (meet(x1, y1, x2, y2, x3, y3, x4, y4)) return false;
  if (meet(x2, y2, x3, y3, x1, y1, x4, y4)) return false;
  if (cross(x1, y1, x2, y2, x3, y3) * cross(x2, y2, x3, y3, x4, y4) < eps ||
      cross(x2, y2, x3, y3, x4, y4) * cross(x3, y3, x4, y4, x1, y1) < eps ||
      cross(x3, y3, x4, y4, x1, y1) * cross(x4, y4, x1, y1, x2, y2) < eps ||
      cross(x4, y4, x1, y1, x2, y2) * cross(x1, y1, x2, y2, x3, y3) < eps)
    return false;
  cout << "YES" << endl;
  printf("%.9f %.9f %.9f %.9f %.9f %.9f %.9f %.9f\n", x1, y1, x2, y2, x3, y3,
         x4, y4);
  return true;
}
int main() {
  cin >> t;
  while (t--) {
    for (i = 1; i <= 3; i++) cin >> x[i] >> y[i];
    if ((x[1] == x[2] && y[1] == y[2]) || (x[1] == x[3] && y[1] == y[3]) ||
        (x[2] == x[3] && y[2] == y[3])) {
      cout << "NO" << endl << endl;
      continue;
    }
    if (solve(1, 2, 3)) continue;
    if (solve(2, 1, 3)) continue;
    if (solve(2, 3, 1)) continue;
    cout << "NO" << endl << endl;
  }
  return 0;
}
