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<bits/stdc++.h>
using namespace std;

struct Point{
    Point(double _x=0,double _y=0):x(_x),y(_y){}
    
    Point operator + (Point p) const {return Point(x+p.x,y+p.y);}
    Point operator - (Point p) const {return Point(x-p.x,y-p.y);}
    Point operator * (double d) const {return Point(x*d,y*d);}
    
    double SqrLength() const{
        return x*x+y*y;
    }
    
    void Read(){
        scanf("%lf%lf",&x,&y);
    }
    
    void Write(){
        printf("%.10f %.10f\n",x,y);
    }
    
    double x,y;  

    friend double Dot(Point p1,Point p2){
        return p1.x*p2.x+p1.y*p2.y;
    }
};

struct Line{
    Line(){}
    Point s,t;
    
    friend Point Project(Point p,Line l){
        Point dir=l.t-l.s;
        return l.s+dir*(Dot(dir,p-l.s)/dir.SqrLength());
    }
    
    friend Point Reflect(Point p,Line l){
        Point q=Project(p,l);
        Point ret=q*2-p;
        return ret;
    }
};

int main(){
    Line l;
    l.s.Read(); l.t.Read();
    int n; scanf("%d",&n);
    while(n--){
        Point p,q;
        p.Read();
        q=Reflect(p,l);
        q.Write();
    }
    return 0;
}