#include <bits/stdc++.h>
using namespace std;
bool gprintf(int debug, const char *format, ...) {
  if (0 & debug) {
    va_list listpointer;
    va_start(listpointer, format);
    vfprintf(stderr, format, listpointer);
    va_end(listpointer);
    return true;
  } else
    return false;
}
pair<long long, long long> A[100000];
int N;
pair<long long, long long> get_next(pair<long long, long long> &last,
                                    long long i) {
  int m = (i - 1) % N;
  return make_pair(2 * A[m].first - last.first, 2 * A[m].second - last.second);
}
pair<long long, long long> simulate(pair<long long, long long> &last,
                                    long long start, long long end) {
  long long i;
  pair<long long, long long> p = last;
  for (i = start; i <= end; i++) p = get_next(p, i);
  return p;
}
int main() {
  pair<long long, long long> M, s;
  int i;
  long long j;
  cin >> N >> j;
  cin >> M.first >> M.second;
  for ((i) = 0; (i) < (N); (i)++) {
    cin >> A[i].first >> A[i].second;
  }
  j %= 2 * N;
  if (j == 0)
    s = M;
  else
    s = simulate(M, 1, j);
  cout << s.first << " " << s.second << endl;
  return 0;
}

### 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;
bool gprintf(int debug, const char *format, ...) {
  if (0 & debug) {
    va_list listpointer;
    va_start(listpointer, format);
    vfprintf(stderr, format, listpointer);
    va_end(listpointer);
    return true;
  } else
    return false;
}
pair<long long, long long> A[100000];
int N;
pair<long long, long long> get_next(pair<long long, long long> &last,
                                    long long i) {
  int m = (i - 1) % N;
  return make_pair(2 * A[m].first - last.first, 2 * A[m].second - last.second);
}
pair<long long, long long> simulate(pair<long long, long long> &last,
                                    long long start, long long end) {
  long long i;
  pair<long long, long long> p = last;
  for (i = start; i <= end; i++) p = get_next(p, i);
  return p;
}
int main() {
  pair<long long, long long> M, s;
  int i;
  long long j;
  cin >> N >> j;
  cin >> M.first >> M.second;
  for ((i) = 0; (i) < (N); (i)++) {
    cin >> A[i].first >> A[i].second;
  }
  j %= 2 * N;
  if (j == 0)
    s = M;
  else
    s = simulate(M, 1, j);
  cout << s.first << " " << s.second << endl;
  return 0;
}

```