#include<bits/stdc++.h>
#define lb long double
using namespace std;
struct Po{lb x,y;}p1,p2,np,x,nx;
int t; 
void get(Po &x){scanf("%Lf %Lf",&x.x,&x.y);}
Po operator -(Po x,Po y){return (Po){x.x-y.x,x.y-y.y};}
Po operator +(Po x,Po y){return (Po){x.x+y.x,x.y+y.y};}
lb operator ^(Po x,Po y){return x.x*y.x+x.y*y.y;}
Po operator *(Po x,lb y){return (Po){x.x*y,x.y*y};}
lb le2(Po x){return x.x*x.x+x.y*x.y;}
int main(){
	get(p1);get(p2);np=p2-p1;lb lp=le2(np);
	scanf("%d",&t);
	while (t--){
		get(x);
		nx=np*((np^(x-p1))/lp);
		x=p1+p1+nx+nx-x;
		printf("%.10Lf %.10Lf\n",x.x,x.y);
	}
	return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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>
#define lb long double
using namespace std;
struct Po{lb x,y;}p1,p2,np,x,nx;
int t; 
void get(Po &x){scanf("%Lf %Lf",&x.x,&x.y);}
Po operator -(Po x,Po y){return (Po){x.x-y.x,x.y-y.y};}
Po operator +(Po x,Po y){return (Po){x.x+y.x,x.y+y.y};}
lb operator ^(Po x,Po y){return x.x*y.x+x.y*y.y;}
Po operator *(Po x,lb y){return (Po){x.x*y,x.y*y};}
lb le2(Po x){return x.x*x.x+x.y*x.y;}
int main(){
	get(p1);get(p2);np=p2-p1;lb lp=le2(np);
	scanf("%d",&t);
	while (t--){
		get(x);
		nx=np*((np^(x-p1))/lp);
		x=p1+p1+nx+nx-x;
		printf("%.10Lf %.10Lf\n",x.x,x.y);
	}
	return 0;
}

```