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 <cmath>
#include <iomanip>
#include <iostream>

using namespace std;

#define EPS 1e-9

double dist(int x, int y)
{
	return sqrt(x * x + y * y);
}

double angle(int x, int y)
{
	return atan2((double)(x), (double)(y));
}

int main()
{
	int x0, x1, y0, y1, x2, y2, q;

	cin >> x0 >> y0 >> x1 >> y1 >> q;

	for (int i = 0; i < q; i++)
	{
		cin >> x2 >> y2;

		int ax = x1 - x0;
		int ay = y1 - y0;
		int bx = x2 - x0;
		int by = y2 - y0;

		double br = dist(bx, by);
		double cr = dist(bx, by);

		double at = angle(ay, ax);
		double bt = angle(by, bx);

		double ct = bt - (bt - at) * 2;

		double cx = x0 + cr * cos(ct);
		double cy = y0 + cr * sin(ct);

		if (cx < -EPS || EPS < cx)
		{
			cout << setprecision(15) << cx << ' ';
		}
		else
		{
			cout << 0 << ' ';
		}

		if (cy < -EPS || EPS < cy)
		{
			cout << setprecision(15) << cy << endl;
		}
		else
		{
			cout << 0 << endl;
		}
	}

	return 0;
}