#include <bits/stdc++.h>
using namespace std;
bool is_prime(int i) {
  for (int j = 2; j <= sqrt(i); ++j) {
    if (i % j == 0) {
      return false;
    }
  }
  return true;
}
pair<long long int, long long int> p;
int main() {
  ios::sync_with_stdio(false);
  long long int n;
  long long int j;
  cin >> n >> j;
  cin >> p.first >> p.second;
  pair<long long int, long long int> A[n + 1];
  for (int i = 0; i < n; ++i) cin >> A[i].first >> A[i].second;
  long long int ans = p.first;
  long long int r = j / n;
  if (r % 2 == 0) {
    for (int i = 0; i < j % n; ++i) ans = 2 * A[i].first - ans;
  } else {
    for (int i = 0; i < n + j % n; ++i) {
      ans = 2 * A[i % n].first - ans;
    }
  }
  cout << ans << " ";
  ans = p.second;
  r = j / n;
  if (r % 2 == 0) {
    for (int i = 0; i < j % n; ++i) ans = 2 * A[i % n].second - ans;
  } else {
    for (int i = 0; i < n + j % n; ++i) ans = 2 * A[i % n].second - ans;
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution 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;
bool is_prime(int i) {
  for (int j = 2; j <= sqrt(i); ++j) {
    if (i % j == 0) {
      return false;
    }
  }
  return true;
}
pair<long long int, long long int> p;
int main() {
  ios::sync_with_stdio(false);
  long long int n;
  long long int j;
  cin >> n >> j;
  cin >> p.first >> p.second;
  pair<long long int, long long int> A[n + 1];
  for (int i = 0; i < n; ++i) cin >> A[i].first >> A[i].second;
  long long int ans = p.first;
  long long int r = j / n;
  if (r % 2 == 0) {
    for (int i = 0; i < j % n; ++i) ans = 2 * A[i].first - ans;
  } else {
    for (int i = 0; i < n + j % n; ++i) {
      ans = 2 * A[i % n].first - ans;
    }
  }
  cout << ans << " ";
  ans = p.second;
  r = j / n;
  if (r % 2 == 0) {
    for (int i = 0; i < j % n; ++i) ans = 2 * A[i % n].second - ans;
  } else {
    for (int i = 0; i < n + j % n; ++i) ans = 2 * A[i % n].second - ans;
  }
  cout << ans << endl;
  return 0;
}

```