#include <bits/stdc++.h>
using namespace std;
long long n, x, k;
struct node {
  long long v, id;
  node(long long a = 0, long long b = 0) : v(a), id(b) {}
  bool operator<(const node& y) const { return abs(v) > abs(y.v); }
} a[10000021];
priority_queue<node> q;
long long ans[1021141];
void add(node& u, long long op) {
  if (u.v >= 0)
    u.v += op * x;
  else
    u.v -= op * x;
}
int main() {
  scanf("%lld%lld%lld", &n, &k, &x);
  long long now = 1;
  for (long long z, i = 1; i <= n; i++) {
    scanf("%lld", &z);
    q.push(node(z, i));
    if (z < 0) now *= -1;
  }
  while (k--) {
    node u = q.top();
    q.pop();
    if (now == 1) {
      if (u.v < x) now *= -1;
      add(u, -1);
    } else
      add(u, 1);
    q.push(u);
  }
  while (!q.empty()) {
    node u = q.top();
    ans[u.id] = u.v;
    q.pop();
  }
  for (long long i = 1; i <= n; i++) printf("%lld ", ans[i]);
  return 0;
}
