#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000000;
long long int N, J;
int X[maxN], Y[maxN];
unsigned long long Mx, My;
int main() {
  cin >> N >> J;
  cin >> Mx >> My;
  for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
  unsigned long long tx = 0, ty = 0;
  for (int i = 0, j = 1; i < N; i++, j *= -1) {
    tx += j * X[i];
    ty += j * Y[i];
  }
  long long retx = 0, rety = 0;
  int j = 1;
  for (int i = (J % N) - 1; i >= 0; i--, j *= -1) {
    retx += j * X[i];
    rety += j * Y[i];
  }
  if (J >= N && (J / N) % 2) {
    retx += j * tx, rety += j * ty;
    j *= -1;
  }
  retx *= 2;
  rety *= 2;
  retx += j * Mx, rety += j * My;
  cout << retx << " " << rety << endl;
}
