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<bits/stdc++.h>
using namespace std;

struct vec{
	long double x , y;
	vec(long double _x = 0 , long double _y = 0){x = _x; y = _y;}
	friend vec operator +(vec a , vec b){return vec(a.x + b.x , a.y + b.y);}
	friend vec operator -(vec a , vec b){return vec(a.x - b.x , a.y - b.y);}
	friend long double operator *(vec a , vec b){return a.x * b.x + a.y * b.y;}
	friend vec operator *(vec a , long double b){return vec(a.x * b , a.y * b);}
	long double len(){return sqrt(x * x + y * y);}
};

vec getvec(){int x , y; cin >> x >> y; return vec(x , y);}

int main(){
	vec A = getvec() , B = getvec(); B = B - A; int Q;
	for(cin >> Q ; Q ; --Q){
		vec Q = getvec() - A;
		long double T = Q * B / B.len();
		vec ans = (A + B * (T / B.len())) * 2 - (A + Q);
		cout << fixed << setprecision(10) << ans.x << ' ' << ans.y << endl;
	}
	return 0;
}