#include<iostream>
#include<iomanip>
using namespace std;

int main(){
	double xp1,yp1,xp2,yp2,x0,y0,x,y,a;
	int i,q;
	
	cin>>xp1>>yp1>>xp2>>yp2;
	cin>>q;
	
	if(xp1==xp2){
		for(i=0;i<q;i++){
			cin>>x0>>y0;
			cout<<fixed<<setprecision(10)<<2*xp1-x0;
			cout<<" "<<fixed<<setprecision(10)<<y0<<endl;
		}
	}else{
		a=(yp2-yp1)/(xp2-xp1);
		for(i=0;i<q;i++){
			cin>>x0>>y0;
			x=a*((y0-yp1)-a*(x0-xp1))/(1+a*a)+x0;
        	y=(a*(a*y0+x0-xp1)+yp1)/(1+a*a);
			cout<<fixed<<setprecision(10)<<2*x-x0;
			cout<<" "<<fixed<<setprecision(10)<<2*y-y0<<endl;
		}
	}
}

### Prompt

Please provide a Cpp coded solution 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<iostream>
#include<iomanip>
using namespace std;

int main(){
	double xp1,yp1,xp2,yp2,x0,y0,x,y,a;
	int i,q;
	
	cin>>xp1>>yp1>>xp2>>yp2;
	cin>>q;
	
	if(xp1==xp2){
		for(i=0;i<q;i++){
			cin>>x0>>y0;
			cout<<fixed<<setprecision(10)<<2*xp1-x0;
			cout<<" "<<fixed<<setprecision(10)<<y0<<endl;
		}
	}else{
		a=(yp2-yp1)/(xp2-xp1);
		for(i=0;i<q;i++){
			cin>>x0>>y0;
			x=a*((y0-yp1)-a*(x0-xp1))/(1+a*a)+x0;
        	y=(a*(a*y0+x0-xp1)+yp1)/(1+a*a);
			cout<<fixed<<setprecision(10)<<2*x-x0;
			cout<<" "<<fixed<<setprecision(10)<<2*y-y0<<endl;
		}
	}
}

```