#include <bits/stdc++.h>
int pocX, pocY;
int tackeX[100005];
int tackeY[100005];
long long rind;
int n;
int main() {
  scanf("%d %I64d", &n, &rind);
  scanf("%d %d", &pocX, &pocY);
  for (int i = 0; i < n; i++) scanf("%d %d", tackeX + i, tackeY + i);
  int sX, sY;
  sX = pocX;
  sY = pocY;
  for (int i = 0; i < n; i++) {
    sX = sX + 2 * (tackeX[i] - sX);
    sY = sY + 2 * (tackeY[i] - sY);
  }
  if (rind / n % 2 == 1) {
    pocX = sX;
    pocY = sY;
  }
  sX = pocX;
  sY = pocY;
  rind %= n;
  int kol = rind;
  for (int i = 0; i < kol; i++) {
    sX = sX + 2 * (tackeX[i] - sX);
    sY = sY + 2 * (tackeY[i] - sY);
  }
  printf("%d %d\n", sX, sY);
  return 0;
}

### Prompt

Create a solution in cpp for 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>
int pocX, pocY;
int tackeX[100005];
int tackeY[100005];
long long rind;
int n;
int main() {
  scanf("%d %I64d", &n, &rind);
  scanf("%d %d", &pocX, &pocY);
  for (int i = 0; i < n; i++) scanf("%d %d", tackeX + i, tackeY + i);
  int sX, sY;
  sX = pocX;
  sY = pocY;
  for (int i = 0; i < n; i++) {
    sX = sX + 2 * (tackeX[i] - sX);
    sY = sY + 2 * (tackeY[i] - sY);
  }
  if (rind / n % 2 == 1) {
    pocX = sX;
    pocY = sY;
  }
  sX = pocX;
  sY = pocY;
  rind %= n;
  int kol = rind;
  for (int i = 0; i < kol; i++) {
    sX = sX + 2 * (tackeX[i] - sX);
    sY = sY + 2 * (tackeY[i] - sY);
  }
  printf("%d %d\n", sX, sY);
  return 0;
}

```