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 CPP):

Solution:
#include <iostream>
#include <cstdio>

using namespace std;

int main(){

	double p0x,p0y,p1x,p1y,p2x,p2y,tx,ty;
	int q;
	double a01,a2t,b01,b2t;

	cin>>p0x>>p0y>>p1x>>p1y;

	cin>>q;

	for(int i=0;i<q;i++){
		cin>>p2x>>p2y;
		if(p0x-p1x!=0) a01=(p0y-p1y)/(p0x-p1x);
		else a01=0;
		if(a01!=0) a2t=-1/a01;
		else a2t=0;
		b2t=p2y-a2t*p2x;
		b01=p0y-a01*p0x;
		if(a01-a2t!=0) tx=(b2t-b01)/(a01-a2t);
		else tx=0;
		ty=a01*tx+b01;
		if(p0x==p1x) ty=p2y;
		if(p0y==p1y) tx=p2x;
		ty=p2y-(p2y-ty)*2;
		tx=p2x-(p2x-tx)*2;
		printf("%.10f %.10f\n",tx,ty);
	}

	return 0;
}