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
{
    double x,y;
    Point(){ x = y = 0.0; }
    Point(double _x, double _y) : x(_x), y(_y){}

    Point operator+ (Point p)
    {
        return Point(p.x + x, p.y + y);
    }

    Point operator- (Point p)
    {
        return Point(x - p.x, y - p.y);
    }

    double operator* (Point p)
    {
        return p.x * x + p.y * y;
    }

    Point operator* (double t)
    {
        return Point(x*t, y*t);
    }

};

Point projection(Point p1, Point p2, Point o)
{
    Point a = (p2 - p1);
    Point b = (o - p1);
    return p1 + a * ( (a * b) / (a * a) );
}

int main()
{
    cout.precision(10);
    cout << fixed;
    int q;
    Point p1, p2, o, ans;
    cin >> p1.x >> p1.y >> p2.x >> p2.y;
    cin >> q;
    while(q--)
    {
        cin >> o.x >> o.y;
        ans = projection(p1, p2, o);
        Point aux = o + (ans - o) * 2.0;
        cout << aux.x << " " << aux.y << '\n';
    }

    return 0;
}