#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;

int main(){
  double x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  int q;
  cin >> q;

  double x, y, k;
  double ax, ay, bx, by;
  double hx, hy;
  double ansx, ansy;
  for(int i=0; i<q; i++){
    cin >> x >> y;
    ax = x-x1; ay = y-y1;
    bx = x2-x1; by = y2-y1;
    k = (ax*bx + ay*by)/(bx*bx + by*by);
    hx = bx*k+x1+0; hy = by*k+y1+0;
    ansx = hx + (hx-x); ansy = hy + (hy-y);
    printf("%.10lf %.10lf\n", ansx, ansy);
  }

  return 0;
}


### Prompt

Construct a cpp code solution to the problem outlined:

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

### Response

```cpp
#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;

int main(){
  double x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  int q;
  cin >> q;

  double x, y, k;
  double ax, ay, bx, by;
  double hx, hy;
  double ansx, ansy;
  for(int i=0; i<q; i++){
    cin >> x >> y;
    ax = x-x1; ay = y-y1;
    bx = x2-x1; by = y2-y1;
    k = (ax*bx + ay*by)/(bx*bx + by*by);
    hx = bx*k+x1+0; hy = by*k+y1+0;
    ansx = hx + (hx-x); ansy = hy + (hy-y);
    printf("%.10lf %.10lf\n", ansx, ansy);
  }

  return 0;
}


```