#include<bits/stdc++.h>
using namespace std;
struct point{
	double x,y;
	point(){}
	point(double _x,double _y){
		x=_x;y=_y;
	}
	point operator +(const point &b) const{
		return point(x+b.x,y+b.y);
	}
	point operator -(const point &b) const{
		return point(x-b.x,y-b.y);
	}
	double operator ^(const point &b) const{
		return (x*b.x)+(y*b.y);
	}
	double operator *(const point &b) const{
		return x*b.y-y*b.x;
	}
	point operator *(const double &b) const{
		return point(x*b,y*b);
	}
};
double len(point p){
	return (p.x*p.x+p.y*p.y);
}
int main(){
	point res,p1,p2,p;
	cin>>p1.x>>p1.y>>p2.x>>p2.y;
	int q;
	cin>>q;
	while(q--){
		cin>>p.x>>p.y;
		res=(p2-p1)*(((p-p1)^(p2-p1))/len(p2-p1));
		res=res+p1;
		res=(res-p)*2+p;
		if(fabs(res.x)==0) res.x=0;
		if(fabs(res.y)==0) res.y=0;
		printf("%.8lf %.8lf\n",res.x,res.y);
	}
	return 0;
}

### Prompt

In CPP, your task is to solve 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;
struct point{
	double x,y;
	point(){}
	point(double _x,double _y){
		x=_x;y=_y;
	}
	point operator +(const point &b) const{
		return point(x+b.x,y+b.y);
	}
	point operator -(const point &b) const{
		return point(x-b.x,y-b.y);
	}
	double operator ^(const point &b) const{
		return (x*b.x)+(y*b.y);
	}
	double operator *(const point &b) const{
		return x*b.y-y*b.x;
	}
	point operator *(const double &b) const{
		return point(x*b,y*b);
	}
};
double len(point p){
	return (p.x*p.x+p.y*p.y);
}
int main(){
	point res,p1,p2,p;
	cin>>p1.x>>p1.y>>p2.x>>p2.y;
	int q;
	cin>>q;
	while(q--){
		cin>>p.x>>p.y;
		res=(p2-p1)*(((p-p1)^(p2-p1))/len(p2-p1));
		res=res+p1;
		res=(res-p)*2+p;
		if(fabs(res.x)==0) res.x=0;
		if(fabs(res.y)==0) res.y=0;
		printf("%.8lf %.8lf\n",res.x,res.y);
	}
	return 0;
}

```