#!/usr/bin/env python3

def solve(p, r, y):
  # p = e - w
  # r = n - s
  # y = n + e + s + w

  # So:
  #   y = n + e + (n - r) + (e - p)
  #   y = 2n + 2e - (r + p)
  #   n + e = (y + r + p)/2

  lest = 0.0
  mest = 4.0
  rest = (0, 0, 0, 0)

  last_good = (-10, -10, -10, -10)

  for i in range(100):
    guess = (lest + mest) / 2.0
    possible = None

    for e_large in [False, True]:
      for ew_sgn in [-1, +1]:
        if e_large:
          e = guess * ew_sgn
          w = e - p
        else:
          w = guess * ew_sgn
          e = w - p
      n = (y + r + p) / 2.0 - e
      s = n - r
      if max(map(abs, (e, w, s, n))) <= guess + 1e-9:
        possible = (n, e, s, w)

    for n_large in [False, True]:
      for ns_sgn in [-1, +1]:
        if n_large:
          n = guess * ns_sgn
          s = n - r
        else:
          s = guess * ns_sgn
          n = s - r
      e = (y + r + p) / 2.0 - n
      w = e - p
      if max(map(abs, (e, w, s, n))) <= guess + 1e-9:
        possible = (n, e, s, w)

    if possible is not None:
      mest = guess
      last_good = possible
    else:
      lest = guess

  last_good = map(lambda x: 0 if abs(x) < 1e-8 else x, last_good)
  return last_good

def main():
  for i in range(int(input())):
    print('{:.8f} {:.8f} {:.8f} {:.8f}'.format(*solve(*map(float, input().split()))))

if __name__ == '__main__':
  main()