#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct point {
  ll x, y;
  point(ll _x = 0, ll _y = 0) { x = _x, y = _y; }
  point operator+(const point &p) { return {x + p.x, y + p.y}; }
  point operator-(const point &p) { return {x - p.x, y - p.y}; }
  point operator*(long long m) { return {x * m, y * m}; }
  void scan() { scanf("%lld%lld", &x, &y); }
};
int main() {
  ll n, j;
  point m, ans, pt;
  scanf("%lld%lld", &n, &j);
  j--;
  j %= 2 * n;
  m.scan();
  auto coef = [&](ll i) {
    if (j < i || j >= i + n) return 0;
    if (j % 2 == i % 2) return 1;
    return -1;
  };
  for (ll i = 0; i < n; i++) {
    pt.scan();
    ans = ans + (pt - m) * coef(i);
  }
  ans = (ans * 2) + m;
  printf("%lld %lld\n", ans.x, ans.y);
  return 0;
}
