#include <bits/stdc++.h>
using namespace std;
const int maxN(2e5 + 10);
int N, K, x, C;
long long A[maxN], ans[maxN];
priority_queue<pair<long long, int>, vector<pair<long long, int> >,
               greater<pair<long long, int> > >
    heap;
template <typename T>
T Abs(const T x) {
  return x > 0 ? x : -x;
}
int main() {
  cin >> N >> K >> x;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    ans[i] = A[i];
    C += A[i] < 0;
    heap.push(pair<long long, int>(Abs(A[i]), i));
  }
  while (!heap.empty() && K) {
    const pair<long long, int> top(heap.top());
    heap.pop();
    const long long val(top.first), i(top.second);
    if (C % 2) {
      if (ans[i] < 0)
        ans[i] -= x;
      else
        ans[i] += x;
    } else {
      if (ans[i] < 0) {
        ans[i] += x;
        C += ans[i] >= 0;
      } else {
        ans[i] -= x;
        C += ans[i] < 0;
      }
    }
    K--;
    heap.push(pair<long long, int>(Abs(ans[i]), i));
  }
  for (int i = 0; i < N; i++) cout << ans[i] << ' ';
}
