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 <iomanip>
using namespace std;

struct Point{double x,y;};//点
struct Segment{Point p1,p2;};//線
double dot(Point a,Point b){//内積
    return a.x*b.x+a.y*b.y;
}
double cross(Point a,Point b){//外積
    return a.x*b.y-a.y*b.x;
}
double norm(Point a){
    return a.x*a.x+a.y*a.y;
}
Point project(Segment s,Point p){
    Point base,q;
    Point ans;
    base.x=s.p2.x-s.p1.x;
    base.y=s.p2.y-s.p1.y;
    q.x=p.x-s.p1.x;
    q.y=p.y-s.p1.y;
    double r=dot(q,base)/norm(base);
    ans.x=s.p1.x+base.x*r;
    ans.y=s.p1.y+base.y*r;
    return ans;
}
Point reflect(Segment s,Point p){
    Point ans;
    ans.x=p.x+(project(s,p).x-p.x)*2.0;
    ans.y=p.y+(project(s,p).y-p.y)*2.0;
    return ans;
}

int main(void){
    int n;
    Segment a;
    Point p,ans;
    cin>>a.p1.x>>a.p1.y>>a.p2.x>>a.p2.y;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>p.x>>p.y;
        ans=reflect(a,p);
        cout<<fixed<<setprecision(10)<<ans.x<<" "<<ans.y<<endl;
    }
    return 0;
}