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<cmath>
#define Point Vector
using namespace std;
class Vector
{
public:
	double x;
	double y;
	Vector(double x = 0, double y = 0) :x(x), y(y) {}
	Vector operator +(Vector &p)
	{
		return Vector(x + p.x, y + p.y);
	}
	Vector operator -(Vector &p)
	{
		return Vector(x - p.x, y - p.y);
	}
	Vector operator *(double k)
	{
		return Vector(k*x, k*y);
	}
	double abs(Vector &p)
	{
		return sqrt(p.x*p.x + p.y*p.y);
	}
	double dot(Vector &p1, Vector &p2)
	{
		return p1.x*p2.x + p1.y*p2.y;
	}
	Point projection(Point p1, Point p2)
	{
		Vector p1p(x - p1.x, y - p1.y);
		Vector p1p2(p2.x - p1.x, p2.y - p1.y);
		double pj = dot(p1p, p1p2) / abs(p1p2);
		Vector p1x = p1p2 * (pj / abs(p1p2));
		Point x = p1x + p1;
		return x;
	}
	Point reflection(Point &p1, Point &p2)
	{
		Point x = this->projection(p1, p2);
		return (x - *this) * 2 + *this;
	}
};
int main()
{
	double x1, y1, x2, y2;
	cin >> x1 >> y1 >> x2 >> y2;
	Point p1(x1, y1);
	Point p2(x2, y2);
	int q;
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		double x, y;
		cin >> x >> y;
		Point p(x, y);
		Point res = p.reflection(p1, p2);
		printf("%.10f %.10f\n", res.x, res.y);
	}
}