#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(2, 0);
  if (b <= 1) {
    ans[b] = a;
  } else if (b % 3 == 2) {
    ans[0] = ans[1] = -a;
  } else if (b % 3 == 0) {
    ans[0] = a;
  } else {
    ans[1] = a;
  }
  cout << ans[1] << ' ' << ans[0] << '\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;
}