#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll a, b;
  cin >> a >> b;
  vector<ll> ans(3, 0);
  if (b <= 1) {
    ans[b + 1] = a;
  } else {
    ans[2] = a;
    rep(i, b - 1) {
      rep(j, 3) ans[j] -= ans[2];
      rep(j, 2) ans[2 - j] = ans[1 - j];
      ans[0] = 0;
    }
  }
  cout << ans[2] << ' ' << ans[1] << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}