#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> A[100005];
pair<long long, long long> M;
int n;
pair<long long, long long> operator+(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return make_pair(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return make_pair(a.first - b.first, a.second - b.second);
}
pair<long long, long long> getp(int j) {
  if (j == 0) return M;
  return A[(j - 1) % n] + A[(j - 1) % n] - getp(j - 1);
}
int main() {
  long long jj;
  scanf("%i %I64d ", &n, &jj);
  int j;
  j = (int)(jj % (2ll * n));
  scanf("%I64d %I64d ", &M.first, &M.second);
  for (int i = (0); i < (n); i++)
    scanf("%I64d %I64d ", &A[i].first, &A[i].second);
  pair<long long, long long> P = getp(j);
  printf("%I64d %I64d\n", P.first, P.second);
  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;
pair<long long, long long> A[100005];
pair<long long, long long> M;
int n;
pair<long long, long long> operator+(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return make_pair(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return make_pair(a.first - b.first, a.second - b.second);
}
pair<long long, long long> getp(int j) {
  if (j == 0) return M;
  return A[(j - 1) % n] + A[(j - 1) % n] - getp(j - 1);
}
int main() {
  long long jj;
  scanf("%i %I64d ", &n, &jj);
  int j;
  j = (int)(jj % (2ll * n));
  scanf("%I64d %I64d ", &M.first, &M.second);
  for (int i = (0); i < (n); i++)
    scanf("%I64d %I64d ", &A[i].first, &A[i].second);
  pair<long long, long long> P = getp(j);
  printf("%I64d %I64d\n", P.first, P.second);
  return 0;
}

```