B. Hello Hello Infinite Line
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Batata gave you an infinite straight line passing through two distinct integer points $$$A(x_1, y_1)$$$ and $$$B(x_2, y_2)$$$.

Find two distinct integer points $$$C(x_3, y_3)$$$ and $$$D(x_4, y_4)$$$ such that the infinite line passing through $$$C$$$ and $$$D$$$ is strictly parallel to the line passing through $$$A$$$ and $$$B$$$ (i.e., the two lines never intersect).

Input

The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

The only line of each test case contains four integers $$$x_1, y_1, x_2, y_2$$$ ($$$-1000 \le x_1, y_1, x_2, y_2 \le 1000$$$) — the coordinates of point $$$A$$$ and point $$$B$$$.

It is guaranteed that point $$$A$$$ and point $$$B$$$ are distinct (either $$$x_1 \neq x_2$$$ or $$$y_1 \neq y_2$$$).

Output

For each test case, output four integers $$$x_3, y_3, x_4, y_4$$$ ($$$-10^9 \le x_3, y_3, x_4, y_4 \le 10^9$$$) — the coordinates of point $$$C$$$ and point $$$D$$$.

The following conditions must be met:

  • Point $$$C$$$ and point $$$D$$$ must be distinct;
  • The infinite line passing through $$$C$$$ and $$$D$$$ must not intersect the infinite line passing through $$$A$$$ and $$$B$$$;
  • If there are multiple valid pairs of points, you can output any of them.
Example
Input
3
0 0 1 1
0 0 0 5
3 4 -2 1
Output
0 1 1 2
1 0 1 5
3 5 -2 2