#include <stdio.h>
#include <math.h>

int main(void) {
  double x1, y1, x2, y2, xp, yp, d, x2p, y2p;
  scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
  x2 -= x1, y2 -= y1;
  d = sqrt(x2 * x2 + y2 * y2);
  x2p = x2 / d, y2p = y2 / d;
  int q, i;
  scanf("%d", &q);
  for(i = 0; i < q; ++i) {
    scanf("%lf%lf", &xp, &yp);
    xp -= x1, yp -= y1;
    double ip = xp * x2 + yp * y2;
    printf("%.12f %.12f\n", -xp + 2 * (ip / d * x2p) + x1, -yp + 2 * (ip / d * y2p) + y1);
  }
  return 0;
}

### Prompt

Please formulate a CPP solution to the following 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

### Response

```cpp
#include <stdio.h>
#include <math.h>

int main(void) {
  double x1, y1, x2, y2, xp, yp, d, x2p, y2p;
  scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
  x2 -= x1, y2 -= y1;
  d = sqrt(x2 * x2 + y2 * y2);
  x2p = x2 / d, y2p = y2 / d;
  int q, i;
  scanf("%d", &q);
  for(i = 0; i < q; ++i) {
    scanf("%lf%lf", &xp, &yp);
    xp -= x1, yp -= y1;
    double ip = xp * x2 + yp * y2;
    printf("%.12f %.12f\n", -xp + 2 * (ip / d * x2p) + x1, -yp + 2 * (ip / d * y2p) + y1);
  }
  return 0;
}

```