#include <bits/stdc++.h>
using namespace std;
long long int in[100001][2];
int main(void) {
  long long int n, j;
  cin >> n >> j;
  long long int M[2];
  cin >> M[0] >> M[1];
  for (int i = 0; i < n; i++) cin >> in[i][0] >> in[i][1];
  long long int tot[2];
  tot[0] = 0;
  tot[1] = 0;
  for (int i = 0; i < n; i++) {
    tot[0] = 2 * in[i][0] - tot[0];
    tot[1] = 2 * in[i][1] - tot[1];
  }
  long long int c = j / n;
  long long int r = j % n;
  long long int answ[2];
  answ[0] = M[0];
  answ[1] = M[1];
  if (c % 2 == 1 && c) {
    answ[0] = tot[0] - M[0];
    answ[1] = tot[1] - M[1];
  }
  for (int i = 0; i < r; i++) {
    answ[0] = 2 * in[i][0] - answ[0];
    answ[1] = 2 * in[i][1] - answ[1];
  }
  cout << answ[0] << " " << answ[1];
  return 0;
}

### Prompt

Create a solution in CPP for 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;
long long int in[100001][2];
int main(void) {
  long long int n, j;
  cin >> n >> j;
  long long int M[2];
  cin >> M[0] >> M[1];
  for (int i = 0; i < n; i++) cin >> in[i][0] >> in[i][1];
  long long int tot[2];
  tot[0] = 0;
  tot[1] = 0;
  for (int i = 0; i < n; i++) {
    tot[0] = 2 * in[i][0] - tot[0];
    tot[1] = 2 * in[i][1] - tot[1];
  }
  long long int c = j / n;
  long long int r = j % n;
  long long int answ[2];
  answ[0] = M[0];
  answ[1] = M[1];
  if (c % 2 == 1 && c) {
    answ[0] = tot[0] - M[0];
    answ[1] = tot[1] - M[1];
  }
  for (int i = 0; i < r; i++) {
    answ[0] = 2 * in[i][0] - answ[0];
    answ[1] = 2 * in[i][1] - answ[1];
  }
  cout << answ[0] << " " << answ[1];
  return 0;
}

```