#include <bits/stdc++.h>
using namespace std;
const int inf(1010101010);
int n;
long long j;
int x[100005], y[100005];
int main() {
  cin >> n >> j;
  int thex, they;
  cin >> thex >> they;
  for (int i(0); i < (n); i++) cin >> x[i] >> y[i];
  long long resx(0), resy(0);
  for (int i(0); i < (n); i++) {
    long long times((j + n - 1 - i) / n);
    if (times % 2) {
      if (i % 2 == 0) resx += 2 * x[i], resy += 2 * y[i];
      if (i % 2 == 1) resx -= 2 * x[i], resy -= 2 * y[i];
    }
  }
  if (j % 2 == 0) resx *= -1, resy *= -1;
  if (j % 2 == 0) resx += thex, resy += they;
  if (j % 2 == 1) resx -= thex, resy -= they;
  cout << resx << " " << resy << endl;
}
