output_description: For each query, print the distance. The output values should be in a decimal
  fraction with an error less than 0.00000001.
input_description: The entire input looks like:
  
      
      
      q (the number of queries)
      1st query
      2nd query
      ...
      qth query
      
  
  Each query consists of integer coordinates of end points of s1 and s2 in the
  following format:
  
      
      
      xp0 yp0 xp1 yp1 xp2 yp2 xp3 yp3
attempt: from sys import stdin
  
  readline = stdin.readline
  
  
  def main():
      q = int(readline())
      for i in range(q):
          xy = map(int, readline().split())
          p0, p1, p2, p3 = [x + y * 1j for x, y in zip(*[xy] * 2)]
          print("{:.10f}".format(distance(p0, p1, p2, p3)))
  
  
  def lt(a, b):
      if a.real != b.real:
          return a.real < b.real
      return a.imag < b.imag
  
  
  import itertools
  
  
  def distance(p0, p1, p2, p3):
      if is_intersected_ls(p0, p1, p2, p3):
          return 0
      p = []
      for i, j in itertools.product([p0, p1], [p2, p3]):
          p.append(abs(i - j))
      for i, j, k in [(p0, p1, p2), (p0, p1, p3), (p2, p3, p0), (p2, p3, p1)]:
          tmp = intersection_of_perpendicular(i, j, k)
          if (lt(i, k) and lt(k, j)) or (lt(j, k) and lt(k, i)):
              p.append(abs(tmp - k))
  
      return min(p)
  
  
  # line(p1, p2) point(p3)
  def intersection_of_perpendicular(p1, p2, p3):
      return p1 + (p2 - p1) * projecter(p2 - p1, p3 - p1)
  
  
  def projecter(a, b):
      return dot(a, b) / dot(a, a)
  
  
  def dot(a, b):
      return a.real * b.real + a.imag * b.imag
  
  
  def is_intersected_ls(a1, a2, b1, b2):
      eps = 0
      if (
          max(a1.real, a2.real) < min(b1.real, b2.real)
          or max(b1.real, b2.real) < min(a1.real, a2.real)
          or max(a1.imag, a2.imag) < min(b1.imag, b2.imag)
          or max(b1.imag, b2.imag) < min(a1.imag, a2.imag)
      ):
          return False
      return (cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) <= eps) and (
          cross(b2 - b1, a1 - b1) * cross(b2 - b1, a2 - b1) <= eps
      )
  
  
  # http://imagingsolution.blog107.fc2.com/blog-entry-137.html
  def intersection(p1, p2, p3, p4):
      a1 = p4 - p2
      b1 = p2 - p3
      b2 = p1 - p2
      s1 = cross(a1, b2) / 2
      s2 = cross(a1, b1) / 2
      c1 = p1 + (p3 - p1) * s1 / (s1 + s2)
      return c1
  
  
  def cross(a, b):
      return a.real * b.imag - a.imag * b.real
  
  
  main()
  
problem_description: Distance
  
    
  
  For given two segments s1 and s2, print the distance between them.
  
  s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and
  p3.
samples: [{"input": "0 0 1 0 0 1 1 1\n    0 0 1 0 2 1 1 2\n    -1 0 1 0 0 1 0 -1", "output": ".0000000000\n    1.4142135624\n    0.0000000000"}]