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:
#include <iostream>
#include <cmath>
#include <assert.h>
#include <cstdio>
using namespace std;

#define EPS (1e-10)
#define equal(a,b) (fabs((a)-(b)) < EPS)

class Point{
public:
    double x,y;
    
    Point(double x = 0,double y = 0):x(x),y(y){}
    
    Point operator + (Point p){
        return Point(x+p.x,y+p.y);
    }
    Point operator - (Point p){
        return Point(x-p.x,y-p.y);
    }
    Point operator * (double a){
        return Point(a*x,a*y);
    }
    
    double abs(){
        return sqrt(norm());
    }
    double norm(){
        return x*x+y*y;
    }

    bool operator < (const Point &p)const{
        return x != p.x ? x < p.x : y < p.y;
    }
    bool operator == (const Point &p)const{
        return equal(x,p.x) && equal(y,p.y);
    }
};

typedef Point Vector;

double dot(Vector a,Vector b){
    return a.x*b.x+a.y*b.y;
}

double cross(Vector a,Vector b){
    return a.x*b.y - a.y*b.x;
}

static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;

int ccw(Point p0,Point p1,Point p2){
    Vector a = p1 - p0;
    Vector b = p2 - p0;
    
    if(cross(a,b) > EPS) return COUNTER_CLOCKWISE;
    if(cross(a,b) < -EPS) return CLOCKWISE;
    if(dot(a,b) < -EPS) return ONLINE_BACK;
    if(a.norm() < b.norm()) return ONLINE_FRONT;
    return ON_SEGMENT;
}

struct Segment{
    Point p1,p2;
};

bool isIntersect(Point p1,Point p2,Point p3,Point p4){
    return (ccw(p1,p2,p3)*ccw(p1,p2,p4) <= 0 &&
            ccw(p3,p4,p1)*ccw(p3,p4,p2) <= 0);
}

Point getCrossPoint(Segment s1,Segment s2){
    assert(isIntersect(s1.p1,s1.p2,s2.p1,s2.p2));
    Vector base = s2.p2 - s2.p1;
    double d1 = abs(cross(base,s1.p1-s2.p1));
    double d2 = abs(cross(base,s1.p2-s2.p1));
    
    double t = d1/(d1+d2);
    return s1.p1 + (s1.p2 - s1.p1) * t;
}

int main(){
    Segment s1,s2;
    Point ans;
    int n;
    
    cin >> n;
    for(int i = 0 ; i < n ; i++){
    cin >> s1.p1.x >> s1.p1.y >> s1.p2.x >> s1.p2.y
        >> s2.p1.x >> s2.p1.y >> s2.p2.x >> s2.p2.y;
        ans = getCrossPoint(s1,s2);
        printf("%.10f %.10f\n" ,ans.x ,ans.y);
    }
    
    return 0;
}