#include <bits/stdc++.h>
const int N = 1000005;
inline void fr(int &num) {
  num = 0;
  char c = getchar();
  int p = 1;
  while (c < '0' || c > '9') c == '-' ? p = -1, c = getchar() : c = getchar();
  while (c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();
  num *= p;
}
int n, a[N], b[N], x, y, o1[N], o2[N], cnt;
long long m;
int main() {
  fr(n), scanf("%lld", &m), fr(x), fr(y);
  for (register int i = 1; i <= n; ++i) fr(a[i]), fr(b[i]);
  register int T = 2;
  m %= (2 * n);
  while (T--)
    for (register int i = 1; i <= n; ++i)
      o1[cnt] = x, o2[cnt++] = y, x = (a[i] << 1) - x, y = (b[i] << 1) - y;
  printf("%d %d\n", o1[m], o2[m]);
  return 0;
}
