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<cstdio>
#include<complex>
#define Re real()
#define Im imag()
using namespace std;
typedef complex<double> Point;
typedef Point Vector;

double dot(const Point& a, const Point& b)
{
    return (conj(a)*b).Re;
}

int main()
{
    int vol;
    double x1,x2,y1,y2;
    while(~scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2))
    {
        Point p0 = Point(x1,y1),p1 = Point(x2,y2);
        Vector v0 = p1 - p0;
        scanf("%d",&vol);
        while(vol--)
        {
            double tx,ty;
            scanf("%lf%lf",&tx,&ty);
            Point pn = Point(tx,ty);
            Vector v1 = pn - p0;
            Vector v2 = dot(v0,v1)*v0/norm(v0) ;
            Vector v3 = (v2 - v1) + (v2 - v1);
            Point pa = p0 + v1 + v3;
            printf("%.10f %.10f\n",pa.Re,pa.Im);
        }
    }
    return 0;
}