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 <cstdio>
#include <cmath>
struct point{
	double x, y;
	point(double _x = 0, double _y = 0){
		x = _x, y = _y;
	}
	point operator + (const point &rhs) const { return point(x + rhs.x, y + rhs.y); }
	point operator - (const point &rhs) const { return point(x - rhs.x, y - rhs.y); }
}A, B, C, D;
int q;
double dot_product(point a, point b){
	return a.x * b.x + a.y * b.y;
}
point projection(point p, point a, point b){
	double l1 = dot_product(p - a, b - a);
	double l2 = dot_product(b - a, b - a);
	double d = l1 / l2;
	return point(a.x + (b.x - a.x) * d, a.y + (b.y - a.y) * d);
}
point reflection(point p, point a, point b){
	point t = projection(p, a, b);
	return point(2 * t.x - p.x, 2 * t.y - p.y);
}
int main(){
	scanf("%lf%lf%lf%lf", &A.x, &A.y, &B.x, &B.y);
	scanf("%d", &q);
	for (register int i = 1; i <= q; ++i){
		scanf("%lf%lf", &C.x, &C.y);
		D = reflection(C, A, B);
		printf("%.10lf %.10lf\n", D.x, D.y);
	}
}