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: # -*- coding: utf-8 -*-
  
  import collections
  import math
  
  
  class Vector2(collections.namedtuple("Vector2", ["x", "y"])):
  
      def __add__(self, other):
          return Vector2(self.x + other.x, self.y + other.y)
  
      def __sub__(self, other):
          return Vector2(self.x - other.x, self.y - other.y)
  
      def __mul__(self, scalar):
          return Vector2(self.x * scalar, self.y * scalar)
  
      def __neg__(self):
          return Vector2(-self.x, -self.y)
  
      def __pos__(self):
          return Vector2(+self.x, +self.y)
  
      def __abs__(self):  # norm
          return math.sqrt(float(self.x * self.x + self.y * self.y))
  
      def dot(self, other):  # dot product
          return self.x * other.x + self.y * other.y
  
      def cross(self, other):  # cross product
          return self.x * other.y - self.y * other.x
  
  
  def getDistanceSP(segment, point):
      p = point
      p1, p2 = segment
      if (p2 - p1).dot(p - p1) < 0:
          return abs(p - p1)
      if (p1 - p2).dot(p - p2) < 0:
          return abs(p - p2)
      return abs((p2 - p1).cross(p - p1)) / abs(p2 - p1)
  
  
  def getDistance(s1, s2):
      a, b = s1
      c, d = s2
      if intersect(s1, s2):  # intersect
          return 0
      return min(
          getDistanceSP(s1, c),
          getDistanceSP(s1, d),
          getDistanceSP(s2, a),
          getDistanceSP(s2, b),
      )
  
  
  def ccw(p0, p1, p2):
      a = p1 - p0
      b = p2 - p0
      if a.cross(b) > 0:
          return 1  # COUNTER_CLOCKWISE
      elif a.cross(b) < 0:
          return -1  # CLOCKWISE
      elif a.dot(b) < 0:
          return 2  # ONLINE_BACK
      elif abs(a) < abs(b):
          return -2  # ONLINE_FRONT
      else:
          return 0  # ON_SEGMENT
  
  
  def intersect(s1, s2):
      a, b = s1
      c, d = s2
      return ccw(a, b, c) * ccw(a, b, d) <= 0 and ccw(c, d, a) * ccw(c, d, b) <= 0
  
  
  def getCrossPoint(s1, s2):
      a, b = s1
      c, d = s2
      base = d - c
      d1 = abs(base.cross(b - c))
      d2 = abs(base.cross(a - c))
      t = d1 / (d1 + d2)
      return a + (b - a) * t
  
  
  if __name__ == "__main__":
  
      n = int(input())
  
      for _ in range(n):
          l = list(map(int, input().split()))
          s1 = [Vector2(l[0], l[1]), Vector2(l[2], l[3])]
          s2 = [Vector2(l[4], l[5]), Vector2(l[6], l[7])]
  
          x = getCrossPoint(s1, s2)
          print(x.x, x.y)
  
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"}]