Problem: For given three points p1, p2, p, find the reflection point x of p onto p1p2.

<image>

Constraints

* 1 ≤ q ≤ 1000
* -10000 ≤ xi, yi ≤ 10000
* p1 and p2 are not identical.

Input


xp1 yp1 xp2 yp2
q
xp0 yp0
xp1 yp1
...
xpq−1 ypq−1


In the first line, integer coordinates of p1 and p2 are given. Then, q queries are given for integer coordinates of p.

Output

For each query, print the coordinate of the reflection point x. The output values should be in a decimal fraction with an error less than 0.00000001.

Examples

Input

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


Output

-1.0000000000 -1.0000000000
0.0000000000 -1.0000000000
1.0000000000 -1.0000000000


Input

0 0 3 4
3
2 5
1 4
0 3


Output

4.2400000000 3.3200000000
3.5600000000 2.0800000000
2.8800000000 0.8400000000

Solution (in JAVA):

Solution:
import java.util.Scanner;

class Main {
	public static void main(String args[]) {
		Scanner scan = new Scanner(System.in);
		
		double x1, y1, x2, y2, xq, yq, ax, ay;
		double m1, m2, l1, l2;
		
		int q;

		x1 = scan.nextDouble();
		y1 = scan.nextDouble();
		x2 = scan.nextDouble();
		y2 = scan.nextDouble();
		
		//Y - y1 =((y2-y1) / (x2-x1)) * (X-x1)
		
		//p1,p2???????????´???????????? m1
		m1 = (y2-y1) / (x2-x1);
		
		//p1,p2??´????????????  l1
		l1 = y1 - (m1 * x1);
		
		//p???????????????????????????m2
		m2 = -1.0 / m1;
		
		q = scan.nextInt();
		
		for(int i = 0; i < q; i++) {
			xq = scan.nextDouble();
			yq = scan.nextDouble();

			if(x1 == x2) { //?????????????????´
				ax = x1;
				ay = yq;
				
			} else if(y1 == y2) { //??????????°´???
				ax = xq;
				ay = y1;
				
			} else {
				//p???????????????????????? l2
				l2 = yq - (m2 * xq);
			
				//??¬????????§?¨????ax, ay)
				ax = (l2 - l1) / (m1 - m2);
				ay = (l2 * m1 - l1 * m2) / (m1 - m2);
			}
			
			System.out.println((ax + ax - xq) + " " + (ay + ay - yq));
		}
		
		scan.close();
	}
}