#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void amin(T &x, const T &y) {
  if (y < x) x = y;
}
template <class T>
inline void amax(T &x, const T &y) {
  if (x < y) x = y;
}
int N, K, X;
priority_queue<pair<long long, int>, vector<pair<long long, int> >,
               greater<pair<long long, int> > >
    P, Z;
priority_queue<pair<long long, int> > M;
long long ans[200111];
int main() {
  scanf("%d%d%d", &N, &K, &X);
  for (int i = 0, i_len = (N); i < i_len; ++i) {
    int x;
    scanf("%d", &x);
    if (x > 0)
      P.push(pair<long long, int>(x, i));
    else if (x < 0)
      M.push(pair<long long, int>(x, i));
    else
      Z.push(pair<long long, int>(x, i));
  }
  while (K > 0 && M.size() % 2 == 0) {
    pair<long long, int> o;
    K--;
    if (Z.size()) {
      o = Z.top();
      Z.pop();
      o.first -= X;
    } else if (P.size() && M.size()) {
      if (P.top().first < abs(M.top().first)) {
        o = P.top();
        P.pop();
        o.first -= X;
      } else {
        o = M.top();
        M.pop();
        o.first += X;
      }
    } else if (P.size()) {
      o = P.top();
      P.pop();
      o.first -= X;
    } else {
      o = M.top();
      M.pop();
      o.first += X;
    }
    if (o.first < 0) {
      M.push(o);
    } else if (o.first == 0) {
      Z.push(o);
    } else {
      P.push(o);
    }
  }
  while (K > 0) {
    K--;
    if (Z.size()) {
      pair<long long, int> o = Z.top();
      Z.pop();
      o.first += X;
      P.push(o);
    } else if (P.size() && M.size()) {
      if (P.top().first < abs(M.top().first)) {
        pair<long long, int> o = P.top();
        P.pop();
        o.first += X;
        P.push(o);
      } else {
        pair<long long, int> o = M.top();
        M.pop();
        o.first -= X;
        M.push(o);
      }
    } else if (P.size()) {
      pair<long long, int> o = P.top();
      P.pop();
      o.first += X;
      P.push(o);
    } else {
      pair<long long, int> o = M.top();
      M.pop();
      o.first -= X;
      M.push(o);
    }
  }
  while (P.size()) {
    pair<long long, int> o = P.top();
    P.pop();
    ans[o.second] = o.first;
  }
  while (M.size()) {
    pair<long long, int> o = M.top();
    M.pop();
    ans[o.second] = o.first;
  }
  while (Z.size()) {
    pair<long long, int> o = Z.top();
    Z.pop();
    ans[o.second] = o.first;
  }
  for (int i = 0, i_len = (N); i < i_len; ++i)
    printf("%lld%c", ans[i], i == N - 1 ? '\n' : ' ');
  return 0;
}
