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 <vector>
#include <complex>
#include <iomanip>

using namespace std;

typedef complex<double> Point;

ostream& operator<<(ostream& os, const Point& p){
    return os <<  p.real() << " " << p.imag();
}

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

struct Line : vector<Point> {
    Line(const Point& a, const Point& b):vector<Point>{a, b}{}
};

inline Point proj(const Line& l, const Point& p){
    double t = dot(p - l[0], l[1] - l[0]) / norm(l[1] - l[0]);
    return l[0] + (l[1] - l[0]) * t;
}

inline Point refl(const Line& l, const Point& p){
    return p + (proj(l, p) - p) * 2.0;
}

int main(){
    int x0, y0, x1, y1;
    cin >> x0 >> y0 >> x1 >> y1;
    Line l(Point(x0, y0), Point(x1, y1));
    int q;
    cin >> q;
    while(q--){
        int x2, y2;
        cin >> x2 >> y2;
        cout << fixed << setprecision(10) << refl(l, Point(x2, y2)) << '\n';
    }
    return 0;
}