#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repd(i,a,b) for (int i = (a); i < (b); i++)
#define INF LLONG_MAX
typedef long long ll;
void bibs_swap(vector<int>& v, int k)
{
	rep(i, v.size()-1) if(v.at(i)%k>v.at(i+1)%k) swap(v.at(i), v.at(i+1));
}

void show(vector<int> v)
{
	rep(i, v.size()) cout << v.at(i) << endl;
}

int main(void)
{
	double a, b, c, d, e, f, ans_x, ans_y;
	cin >> a >> b >> c >> d;
	double p1p2_inc;
	if(a-c != 0) p1p2_inc = (b-d)/(a-c);
	else p1p2_inc = 0;
	double px_inc;
	if(p1p2_inc != 0)  px_inc = -1/p1p2_inc;
	else  px_inc = 0;
	double p1p2_sec;
	if(a==0 && b==0) p1p2_sec = -p1p2_inc*c + d;
	else p1p2_sec = -p1p2_inc*a + b;
	int q;
	cin >> q;
	rep(i, q)
	{
		cin >> e >> f;
		if(a==c) cout << 2*a - e << " " << f << endl;
		else if(b==d) cout << e << " " << 2*b - f << endl;
		else
		{
		    double px_sec = -px_inc*e + f;
		    ans_x = -(p1p2_sec - px_sec) / (p1p2_inc - px_inc);
		    ans_y = p1p2_inc*ans_x + p1p2_sec;
		    printf("%.9f %.9f\n", 2*ans_x - e, 2*ans_y - f);
		}
	}
	return 0;
}


### Prompt

Your task is to create a cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repd(i,a,b) for (int i = (a); i < (b); i++)
#define INF LLONG_MAX
typedef long long ll;
void bibs_swap(vector<int>& v, int k)
{
	rep(i, v.size()-1) if(v.at(i)%k>v.at(i+1)%k) swap(v.at(i), v.at(i+1));
}

void show(vector<int> v)
{
	rep(i, v.size()) cout << v.at(i) << endl;
}

int main(void)
{
	double a, b, c, d, e, f, ans_x, ans_y;
	cin >> a >> b >> c >> d;
	double p1p2_inc;
	if(a-c != 0) p1p2_inc = (b-d)/(a-c);
	else p1p2_inc = 0;
	double px_inc;
	if(p1p2_inc != 0)  px_inc = -1/p1p2_inc;
	else  px_inc = 0;
	double p1p2_sec;
	if(a==0 && b==0) p1p2_sec = -p1p2_inc*c + d;
	else p1p2_sec = -p1p2_inc*a + b;
	int q;
	cin >> q;
	rep(i, q)
	{
		cin >> e >> f;
		if(a==c) cout << 2*a - e << " " << f << endl;
		else if(b==d) cout << e << " " << 2*b - f << endl;
		else
		{
		    double px_sec = -px_inc*e + f;
		    ans_x = -(p1p2_sec - px_sec) / (p1p2_inc - px_inc);
		    ans_y = p1p2_inc*ans_x + p1p2_sec;
		    printf("%.9f %.9f\n", 2*ans_x - e, 2*ans_y - f);
		}
	}
	return 0;
}


```