Problem: 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.

Constraints

* 1 ≤ q ≤ 1000
* -10000 ≤ xpi, ypi ≤ 10000
* p0 ≠ p1 and p2 ≠ p3.
* The given segments have a cross point and are not in parallel.

Input

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


Output

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.

Example

Input

3
0 0 2 0 1 1 1 -1
0 0 1 1 0 1 1 0
0 0 1 1 1 0 0 1


Output

1.0000000000 0.0000000000
0.5000000000 0.5000000000
0.5000000000 0.5000000000

Solution (in CPP):

Solution:
// CGL_2_C
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
using namespace std;

struct vec{
	double x;
	double y;
};

void find_intersect(vec p[4]){
	double x, y;
	vec v[2];

	for(int i=0;i<2;i++){
		v[i].x = p[2*i+1].x - p[2*i].x;
		v[i].y = p[2*i+1].y - p[2*i].y;
	}

	x = (v[0].y*v[1].x*p[0].x-v[1].y*v[0].x*p[2].x+(p[2].y-p[0].y)*v[1].x*v[0].x)/(v[0].y*v[1].x-v[1].y*v[0].x);
	
	if(v[0].x == 0)
		y = v[1].y/v[1].x*(x-p[2].x)+p[2].y;
	else
		y = v[0].y/v[0].x*(x-p[0].x)+p[0].y;

	printf("%.10lf %.10lf\n", x, y);
}

int main(){
	int q;
	vec p[4];

	cin>>q;
	for(int i=0;i<q;i++){
		cin>>p[0].x>>p[0].y>>p[1].x>>p[1].y>>p[2].x>>p[2].y>>p[3].x>>p[3].y;

		find_intersect(p);
	}

	return 0;
}