#include <bits/stdc++.h>
int const N = 111111;
long long n, j, X, Y, ax[N], ay[N];
int main() {
  std::cin >> n >> j;
  j %= (2 * n);
  std::cin >> X >> Y;
  for (int i = 0; i < n; i++) std::cin >> ax[i] >> ay[i];
  long long resx = X, resy = Y;
  if (j & 1) resx *= -1, resy *= -1;
  --j;
  for (int mult = 1, i = j; i >= 0; i--, mult *= -1)
    resx += 2 * ax[i % n] * mult, resy += 2 * ay[i % n] * mult;
  std::cout << resx << " " << resy << "\n";
  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>
int const N = 111111;
long long n, j, X, Y, ax[N], ay[N];
int main() {
  std::cin >> n >> j;
  j %= (2 * n);
  std::cin >> X >> Y;
  for (int i = 0; i < n; i++) std::cin >> ax[i] >> ay[i];
  long long resx = X, resy = Y;
  if (j & 1) resx *= -1, resy *= -1;
  --j;
  for (int mult = 1, i = j; i >= 0; i--, mult *= -1)
    resx += 2 * ax[i % n] * mult, resy += 2 * ay[i % n] * mult;
  std::cout << resx << " " << resy << "\n";
  return 0;
}

```