#include<bits/stdc++.h>
using namespace std;
double xp1,yp1,xp2,yp2,x,y,xp,yp,l1,r1,l2,r2,sum;
int n;
int main(){
	scanf("%lf%lf%lf%lf",&xp1,&yp1,&xp2,&yp2);
	l1=xp2-xp1;
	r1=yp2-yp1;
	scanf("%d",&n);
	for(int i=1; i<=n; i++){
		scanf("%lf%lf",&x,&y);
		l2=x-xp1;
		r2=y-yp1;
		sum=l1*l2+r1*r2;
		xp=xp1+l1*sum/((l1*l1)+(r1*r1));
		yp=yp1+r1*sum/((l1*l1)+(r1*r1));
		printf("%.8lf %.8lf\n",x+(xp-x)*2,y+(yp-y)*2);
	}
} 

### Prompt

Construct a Cpp code solution to the problem outlined:

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;
double xp1,yp1,xp2,yp2,x,y,xp,yp,l1,r1,l2,r2,sum;
int n;
int main(){
	scanf("%lf%lf%lf%lf",&xp1,&yp1,&xp2,&yp2);
	l1=xp2-xp1;
	r1=yp2-yp1;
	scanf("%d",&n);
	for(int i=1; i<=n; i++){
		scanf("%lf%lf",&x,&y);
		l2=x-xp1;
		r2=y-yp1;
		sum=l1*l2+r1*r2;
		xp=xp1+l1*sum/((l1*l1)+(r1*r1));
		yp=yp1+r1*sum/((l1*l1)+(r1*r1));
		printf("%.8lf %.8lf\n",x+(xp-x)*2,y+(yp-y)*2);
	}
} 

```