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;

class point {
public:
	double x, y;
	point() {}
	point( double x_, double y_ ) :x(x_), y(y_) {}
	point operator -( point p ) { return point( x - p.x, y - p.y ); }
	point operator +( point p ) { return point( x + p.x, y + p.y ); }
	point operator *( int a ) { return point( x * a, y * a ); }
	double dot( point p ) { return p.x * x + p.y * y; }
	double norm() { return x * x + y * y; }
};

int main()
{
	point vp[2];
	cin >> vp[0].x >> vp[0].y >> vp[1].x >> vp[1].y;
	point base = vp[1] - vp[0];
	double norm = base.norm();
	int q;
	cin >> q;
	for( int i = 0; i < q; i++ ) {
		point p;
		cin >> p.x >> p.y;

		double dot = base.dot( p - vp[0] );
		double xd = vp[0].x + base.x * dot / norm;
		double yd = vp[0].y + base.y * dot / norm;
		p = p + ( point( xd, yd ) - p ) * 2;
		cout << fixed << setprecision(10) << p.x << " " << p.y << endl;
	}
}