#include <bits/stdc++.h>
using namespace std;
complex<long long> p[223456], p0;
complex<long long> go(complex<long long> s, long long K) {
  for (int i = 0; i < (K); i++) {
    complex<long long> diff = p[i] - s;
    s += diff + diff;
  }
  return s;
}
int main() {
  long long N, M, x, y;
  cin >> N >> M >> x >> y;
  p0 = complex<long long>(x, y);
  for (int i = 0; i < (N); i++) {
    cin >> x >> y;
    p[i] = p[N + i] = complex<long long>(x, y);
  }
  complex<long long> res = go(p0, M % (2 * N));
  cout << res.real() << ' ' << res.imag() << endl;
  return 0;
}

### Prompt

Please create a solution in cpp 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>
using namespace std;
complex<long long> p[223456], p0;
complex<long long> go(complex<long long> s, long long K) {
  for (int i = 0; i < (K); i++) {
    complex<long long> diff = p[i] - s;
    s += diff + diff;
  }
  return s;
}
int main() {
  long long N, M, x, y;
  cin >> N >> M >> x >> y;
  p0 = complex<long long>(x, y);
  for (int i = 0; i < (N); i++) {
    cin >> x >> y;
    p[i] = p[N + i] = complex<long long>(x, y);
  }
  complex<long long> res = go(p0, M % (2 * N));
  cout << res.real() << ' ' << res.imag() << endl;
  return 0;
}

```