#include <bits/stdc++.h>
int i, j, k, l, n, a[1000000][2], X0, Y0;
long long m, K, R, t1, t2, t3, t4, ans;
int main() {
  scanf("%d%I64d", &n, &m);
  scanf("%d%d", &X0, &Y0);
  for (i = 0; i < n; i++) scanf("%d%d", &a[i][0], &a[i][1]);
  K = m / n;
  R = m % n;
  if (K & 1) {
    if (m & 1) {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 - X0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + a[i][0] * 2;
      for (i = 1; i < n; i++, i++) t2 = t2 + a[i][0] * 2;
      ans = ans + t1 - t2;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 - Y0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + a[i][1] * 2;
      for (i = 1; i < n; i++, i++) t2 = t2 + a[i][1] * 2;
      ans = ans + t1 - t2;
      printf("%I64d ", ans);
    } else {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 + X0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + 2 * a[i][0];
      for (i = 1; i < n; i++, i++) t2 = t2 + 2 * a[i][0];
      ans = ans + t2 - t1;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 + Y0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + 2 * a[i][1];
      for (i = 1; i < n; i++, i++) t2 = t2 + 2 * a[i][1];
      ans = ans + t2 - t1;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
    }
  } else {
    if (m & 1) {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 - X0;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 - Y0;
      printf("%I64d\n", ans);
    } else {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 + X0;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 + Y0;
      printf("%I64d\n", ans);
    }
  }
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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 i, j, k, l, n, a[1000000][2], X0, Y0;
long long m, K, R, t1, t2, t3, t4, ans;
int main() {
  scanf("%d%I64d", &n, &m);
  scanf("%d%d", &X0, &Y0);
  for (i = 0; i < n; i++) scanf("%d%d", &a[i][0], &a[i][1]);
  K = m / n;
  R = m % n;
  if (K & 1) {
    if (m & 1) {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 - X0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + a[i][0] * 2;
      for (i = 1; i < n; i++, i++) t2 = t2 + a[i][0] * 2;
      ans = ans + t1 - t2;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 - Y0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + a[i][1] * 2;
      for (i = 1; i < n; i++, i++) t2 = t2 + a[i][1] * 2;
      ans = ans + t1 - t2;
      printf("%I64d ", ans);
    } else {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 + X0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + 2 * a[i][0];
      for (i = 1; i < n; i++, i++) t2 = t2 + 2 * a[i][0];
      ans = ans + t2 - t1;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 + Y0;
      t1 = t2 = 0;
      for (i = 0; i < n; i++, i++) t1 = t1 + 2 * a[i][1];
      for (i = 1; i < n; i++, i++) t2 = t2 + 2 * a[i][1];
      ans = ans + t2 - t1;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
    }
  } else {
    if (m & 1) {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 - X0;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t1 - t2 - Y0;
      printf("%I64d\n", ans);
    } else {
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][0];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][0];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 + X0;
      printf("%I64d ", ans);
      t1 = t2 = ans = 0;
      for (i = 0; i < R; i++, i++) t1 = t1 + a[i][1];
      for (i = 1; i < R; i++, i++) t2 = t2 + a[i][1];
      t1 <<= 1;
      t2 <<= 1;
      ans = t2 - t1 + Y0;
      printf("%I64d\n", ans);
    }
  }
  return 0;
}

```