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>
#include <cstring>
#include <math.h>
#include <algorithm>
using namespace std;
const int MAXSIZE = 1e4+7;
struct point{
	double x, y;
	point(double a = 0, double b = 0):x(a),y(b){}
};
typedef point Point;
struct segment{
	point a, b;
};
typedef segment Segment;
Point operator *(Point a, double p){
	return Point(a.x * p, a.y*p);
} 
Point operator +(Point a, Point b){
	return Point(a.x + b.x, a.y + b.y);
}
Point operator -(Point a, Point b){
	return Point(a.x - b.x, a.y - b.y);
}
double norm(Point a){
	return a.x * a.x + a.y * a.y;
}
double abs(Point a){
	return sqrt(norm(a));
}
double dot(Point a, Point b){
	return a.x * b.x + a.y * b.y;
}
double cross(Point a, Point b){
	return a.x * b.y - a.y * b.x;
}
Point project(Segment s, Point p){
	Point base = s.b - s.a;
	double r = dot(p - s.a, base) / norm(base);
	return s.a + base * r;
}
Point reflect(Segment s, Point p){
	return p + (project(s,p)-p)*2.0;
}
int main(){
	Segment temp;
	scanf("%lf %lf %lf %lf",&temp.a.x, &temp.a.y, &temp.b.x, &temp.b.y);
	int n;
	Point p;
	scanf("%d",&n);
	while(n--){
		scanf("%lf %lf",&p.x, &p.y);
		Point get = reflect(temp,p);
		printf("%0.10lf %0.10lf\n", get.x, get.y);
	}
	return 0;
}