#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000000;
long long int N, J;
int X[maxN], Y[maxN];
unsigned long long Mx, My;
int main() {
  cin >> N >> J;
  cin >> Mx >> My;
  for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
  unsigned long long tx = 0, ty = 0;
  for (int i = 0, j = 1; i < N; i++, j *= -1) {
    tx += j * X[i];
    ty += j * Y[i];
  }
  long long retx = 0, rety = 0;
  int j = 1;
  for (int i = (J % N) - 1; i >= 0; i--, j *= -1) {
    retx += j * X[i];
    rety += j * Y[i];
  }
  if (J >= N && (J / N) % 2) {
    retx += j * tx, rety += j * ty;
    j *= -1;
  }
  retx *= 2;
  rety *= 2;
  retx += j * Mx, rety += j * My;
  cout << retx << " " << rety << endl;
}

### Prompt

Please provide a cpp coded solution 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;
const int maxN = 1000000;
long long int N, J;
int X[maxN], Y[maxN];
unsigned long long Mx, My;
int main() {
  cin >> N >> J;
  cin >> Mx >> My;
  for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
  unsigned long long tx = 0, ty = 0;
  for (int i = 0, j = 1; i < N; i++, j *= -1) {
    tx += j * X[i];
    ty += j * Y[i];
  }
  long long retx = 0, rety = 0;
  int j = 1;
  for (int i = (J % N) - 1; i >= 0; i--, j *= -1) {
    retx += j * X[i];
    rety += j * Y[i];
  }
  if (J >= N && (J / N) % 2) {
    retx += j * tx, rety += j * ty;
    j *= -1;
  }
  retx *= 2;
  rety *= 2;
  retx += j * Mx, rety += j * My;
  cout << retx << " " << rety << endl;
}

```