#include <bits/stdc++.h>
typedef struct p {
  int x;
  int y;
} Punto;
void calculo(Punto vec[], int n, long long int j);
void cargarvector(Punto vec[], int n);
int main() {
  int n, i;
  long long int j;
  scanf("%d", &n);
  scanf("%I64d", &j);
  Punto vec[n + 1];
  cargarvector(vec, n + 1);
  calculo(vec, n + 1, j);
  printf("%d %d", vec[0].x, vec[0].y);
  return 0;
}
void cargarvector(Punto vec[], int n) {
  int i;
  for (i = 0; i < n; i++) {
    scanf("%d", &vec[i].x);
    scanf("%d", &vec[i].y);
  }
}
void calculo(Punto vec[], int n, long long int j) {
  int i, p;
  i = 1;
  j = j % ((n - 1) * 2);
  for (p = 0; p < j; p++) {
    vec[0].x = 2 * vec[i].x - vec[0].x;
    vec[0].y = 2 * vec[i].y - vec[0].y;
    if (i == n - 1) {
      i = 0;
    }
    i = i + 1;
  }
}

### Prompt

Your challenge is to write 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>
typedef struct p {
  int x;
  int y;
} Punto;
void calculo(Punto vec[], int n, long long int j);
void cargarvector(Punto vec[], int n);
int main() {
  int n, i;
  long long int j;
  scanf("%d", &n);
  scanf("%I64d", &j);
  Punto vec[n + 1];
  cargarvector(vec, n + 1);
  calculo(vec, n + 1, j);
  printf("%d %d", vec[0].x, vec[0].y);
  return 0;
}
void cargarvector(Punto vec[], int n) {
  int i;
  for (i = 0; i < n; i++) {
    scanf("%d", &vec[i].x);
    scanf("%d", &vec[i].y);
  }
}
void calculo(Punto vec[], int n, long long int j) {
  int i, p;
  i = 1;
  j = j % ((n - 1) * 2);
  for (p = 0; p < j; p++) {
    vec[0].x = 2 * vec[i].x - vec[0].x;
    vec[0].y = 2 * vec[i].y - vec[0].y;
    if (i == n - 1) {
      i = 0;
    }
    i = i + 1;
  }
}

```