#include <bits/stdc++.h>
using namespace std;
struct TPoint {
  int X, Y;
};
int N;
long long Ask;
TPoint A[100005], M[100005 * 2];
int main() {
  scanf("%d%I64d", &N, &Ask);
  scanf("%d%d", &M[0].X, &M[0].Y);
  for (int i = 0; i < N; ++i) scanf("%d%d", &A[i].X, &A[i].Y);
  Ask %= (N + N);
  for (int i = 1; i <= Ask; ++i) {
    M[i].X = A[(i - 1) % N].X * 2 - M[i - 1].X;
    M[i].Y = A[(i - 1) % N].Y * 2 - M[i - 1].Y;
  }
  printf("%d %d\n", M[Ask].X, M[Ask].Y);
  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>
using namespace std;
struct TPoint {
  int X, Y;
};
int N;
long long Ask;
TPoint A[100005], M[100005 * 2];
int main() {
  scanf("%d%I64d", &N, &Ask);
  scanf("%d%d", &M[0].X, &M[0].Y);
  for (int i = 0; i < N; ++i) scanf("%d%d", &A[i].X, &A[i].Y);
  Ask %= (N + N);
  for (int i = 1; i <= Ask; ++i) {
    M[i].X = A[(i - 1) % N].X * 2 - M[i - 1].X;
    M[i].Y = A[(i - 1) % N].Y * 2 - M[i - 1].Y;
  }
  printf("%d %d\n", M[Ask].X, M[Ask].Y);
  return 0;
}

```