output_description: For each query, print the coordinate of the cross point. 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: # 交点、非平行の保証付
  def vc(p, q):
      return [p[0] - q[0], p[1] - q[1]]
  
  
  def cross(u, v):
      return u[0] * v[1] - u[1] * v[0]
  
  
  n = int(input())
  for _ in range(n):
      x0, y0, x1, y1, x2, y2, x3, y3 = map(int, input().split())
      p0, p1, p2, p3 = [x0, y0], [x1, y1], [x2, y2], [x3, y3]
      v01 = vc(p1, p0)
      v02 = vc(p2, p0)
      v03 = vc(p3, p0)
      d1 = cross(v01, v02)
      d2 = cross(v01, v03)
      # print(v01,v02,v03,d1,d2)
      if d1 == 0:
          # print("p2")
          print(*p2)
      elif d2 == 0:
          # print("p3")
          print(*p3)
      else:
          mu = abs(d1) / (abs(d1) + abs(d2))
          # print(mu)
          v23 = vc(p3, p2)
          ans = [p2[0] + mu * v23[0], p2[1] + mu * v23[1]]
          print(*ans)
  
problem_description: Cross Point
  
    
  
  For given two segments s1 and s2, print the coordinate of the cross point of
  them.
  
  s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and
  p3.
samples: [{"input": "0 0 2 0 1 1 1 -1\n    0 0 1 1 0 1 1 0\n    0 0 1 1 1 0 0 1", "output": ".0000000000 0.0000000000\n    0.5000000000 0.5000000000\n    0.5000000000 0.5000000000"}]