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

Solution (in CPP):

Solution:
#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<complex>
using namespace std;

int main(){
	cout << fixed << setprecision(10);
	const long double EPS=1e-8;
	long double Re,Im;
	int q;
	complex<long double>p1,p2;
	
	cin>>Re>>Im;
	p1.real(Re);
	p1.imag(Im);
	cin>>Re>>Im;
	p2.real(Re);
	p2.imag(Im);
	cin>>q;
	
	for(int i=0;i<q;i++){
		cin>>Re>>Im;
		complex<long double>tmp(Re,Im),p1_copy=p1,p2_copy=p2;
		
		
		tmp-=p1_copy;
		p2_copy-=p1_copy;
		complex<long double>p1_re=p1_copy;
		p1_copy-=p1_copy;
		tmp=tmp/p2_copy;
		complex<long double>p2_re=p2_copy;
		p2_copy=p2_copy/p2_copy;
		complex<long double>res=tmp;
		res.imag(-res.imag());
		
		
		res*=p2_re;
		res+=p1_re;
		cout<<res.real()<<" "<<res.imag()<<endl;
	}
	
}