#include <bits/stdc++.h>
using namespace std;
struct Pt {
  long long x, y;
} pt[101000], m;
Pt operator+(Pt a, Pt b) {
  a.x += 2 * b.x;
  a.y += 2 * b.y;
  return a;
}
Pt operator-(Pt a, Pt b) {
  a.x -= 2 * b.x;
  a.y -= 2 * b.y;
  return a;
}
int ab(int b) {
  if (b < 0) return -b;
  return b;
}
int main() {
  int n;
  long long j;
  while (scanf("%d", &n) == 1) {
    int i;
    scanf("%I64d%I64d%I64d", &j, &m.x, &m.y);
    for (i = 0; i < n; ++i) {
      scanf("%I64d%I64d", &pt[i].x, &pt[i].y);
    }
    if (j & 1) m.x = -m.x, m.y = -m.y;
    int left = j % (2 * n);
    if (left <= n) {
      for (i = left - 1; i >= 0; --i)
        if ((left - 1 - i) & 1)
          m = m - pt[i];
        else
          m = m + pt[i];
    } else {
      for (i = left - 1; i >= 0; --i)
        if ((left - 1 - i) & 1)
          m = m - pt[i % n];
        else
          m = m + pt[i % n];
    }
    printf("%I64d %I64d\n", m.x, m.y);
  }
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natural number i). Here point B is symmetric to A according M, if M is the center of the line segment AB. Given index j find the point Mj.

Input

On the first line you will be given an integer n (1 ≤ n ≤ 105), which will be odd, and j (1 ≤ j ≤ 1018), where j is the index of the desired point. The next line contains two space separated integers, the coordinates of M0. After that n lines follow, where the i-th line contain the space separated integer coordinates of the point Ai - 1. The absolute values of all input coordinates will not be greater then 1000.

Output

On a single line output the coordinates of Mj, space separated.

Examples

Input

3 4
0 0
1 1
2 3
-5 3


Output

14 0


Input

3 1
5 5
1000 1000
-1000 1000
3 100


Output

1995 1995

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
struct Pt {
  long long x, y;
} pt[101000], m;
Pt operator+(Pt a, Pt b) {
  a.x += 2 * b.x;
  a.y += 2 * b.y;
  return a;
}
Pt operator-(Pt a, Pt b) {
  a.x -= 2 * b.x;
  a.y -= 2 * b.y;
  return a;
}
int ab(int b) {
  if (b < 0) return -b;
  return b;
}
int main() {
  int n;
  long long j;
  while (scanf("%d", &n) == 1) {
    int i;
    scanf("%I64d%I64d%I64d", &j, &m.x, &m.y);
    for (i = 0; i < n; ++i) {
      scanf("%I64d%I64d", &pt[i].x, &pt[i].y);
    }
    if (j & 1) m.x = -m.x, m.y = -m.y;
    int left = j % (2 * n);
    if (left <= n) {
      for (i = left - 1; i >= 0; --i)
        if ((left - 1 - i) & 1)
          m = m - pt[i];
        else
          m = m + pt[i];
    } else {
      for (i = left - 1; i >= 0; --i)
        if ((left - 1 - i) & 1)
          m = m - pt[i % n];
        else
          m = m + pt[i % n];
    }
    printf("%I64d %I64d\n", m.x, m.y);
  }
  return 0;
}

```