Given three coordinate points A, B and C, find the missing point D such that ABCD can be a parallelogram. There can be multiple such points, so print the lexicographically least coordinate.
The first line of input contains an integer T denoting the number of test cases. Each test case contains three lines for each of the point A, B and C with each line containing space separated integers Xi and Yi as coordinates for each of them.
Print two space separated coordinates of the required point with a precision of 6 decimal places.
1<=x,y<=1000 where x and y denote coordinates of points.