#include <bits/stdc++.h>
const int inf = ~0U >> 1, maxn = 100000;
using namespace std;
int n;
long long j;
struct Point {
  long long x, y;
  Point(long long _x = 0, long long _y = 0) : x(_x), y(_y) {}
  Point operator*(int d) { return Point(x * d, y * d); }
  Point operator+(const Point& o) { return Point(x + o.x, y + o.y); }
  Point operator-(const Point& o) { return Point(x - o.x, y - o.y); }
} A[maxn], M, Dp[maxn];
istream& operator>>(istream& in, Point& p) {
  in >> p.x >> p.y;
  return in;
}
void Test() {
  Dp[0] = M;
  for (int i = 1; i <= j; i++) {
    Dp[i] = A[(i - 1) % n] * 2 - Dp[i - 1];
  }
  cout << Dp[j].x << " " << Dp[j].y;
}
int main() {
  cin >> n >> j;
  cin >> M;
  for (int i = 0; i < n; i++) cin >> A[i];
  int sign = 1;
  Point ret;
  for (long long i = j - 1; i >= 0; i--) {
    ret = ret + A[i % n] * sign;
    sign *= -1;
    if (i == j - n) {
      if ((i / n) % 2) sign *= sign, ret.x = ret.y = 0;
      i %= n;
    }
  }
  ret = ret * 2;
  ret = ret + M * sign;
  cout << ret.x << " " << ret.y << endl;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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>
const int inf = ~0U >> 1, maxn = 100000;
using namespace std;
int n;
long long j;
struct Point {
  long long x, y;
  Point(long long _x = 0, long long _y = 0) : x(_x), y(_y) {}
  Point operator*(int d) { return Point(x * d, y * d); }
  Point operator+(const Point& o) { return Point(x + o.x, y + o.y); }
  Point operator-(const Point& o) { return Point(x - o.x, y - o.y); }
} A[maxn], M, Dp[maxn];
istream& operator>>(istream& in, Point& p) {
  in >> p.x >> p.y;
  return in;
}
void Test() {
  Dp[0] = M;
  for (int i = 1; i <= j; i++) {
    Dp[i] = A[(i - 1) % n] * 2 - Dp[i - 1];
  }
  cout << Dp[j].x << " " << Dp[j].y;
}
int main() {
  cin >> n >> j;
  cin >> M;
  for (int i = 0; i < n; i++) cin >> A[i];
  int sign = 1;
  Point ret;
  for (long long i = j - 1; i >= 0; i--) {
    ret = ret + A[i % n] * sign;
    sign *= -1;
    if (i == j - n) {
      if ((i / n) % 2) sign *= sign, ret.x = ret.y = 0;
      i %= n;
    }
  }
  ret = ret * 2;
  ret = ret + M * sign;
  cout << ret.x << " " << ret.y << endl;
}

```