#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  register long long s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * w;
}
struct node {
  long long x, y;
} a[100010];
node na, la;
int main() {
  long long n, x;
  n = read(), x = read();
  la.x = read(), la.y = read();
  for (int i = 1; i <= n; i++) a[i].x = read(), a[i].y = read();
  x %= (2 * n);
  for (int i = 1; i <= x; i++) {
    na.x = a[(i - 1) % n + 1].x * 2 - la.x;
    na.y = a[(i - 1) % n + 1].y * 2 - la.y;
    la = na;
  }
  cout << la.x << " " << la.y;
  return 0;
}

### Prompt

Please formulate a Cpp solution to the following problem:

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;
inline long long read() {
  register long long s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * w;
}
struct node {
  long long x, y;
} a[100010];
node na, la;
int main() {
  long long n, x;
  n = read(), x = read();
  la.x = read(), la.y = read();
  for (int i = 1; i <= n; i++) a[i].x = read(), a[i].y = read();
  x %= (2 * n);
  for (int i = 1; i <= x; i++) {
    na.x = a[(i - 1) % n + 1].x * 2 - la.x;
    na.y = a[(i - 1) % n + 1].y * 2 - la.y;
    la = na;
  }
  cout << la.x << " " << la.y;
  return 0;
}

```