#include <bits/stdc++.h>
using namespace std;
int n, k;
long long x;
long long rec[205000];
struct node {
  int id;
  long long num;
};
bool operator<(const node& a, const node& b) { return abs(a.num) > abs(b.num); }
int main() {
  scanf("%d%d%I64d", &n, &k, &x);
  int judge = 1;
  long long M = 1LL << 50;
  int tag = -1;
  for (int i = 1; i <= n; i++) {
    long long tmp;
    scanf("%I64d", &tmp);
    if (M > abs(tmp)) {
      M = abs(tmp);
      tag = i;
    }
    if (tmp != 0) judge = judge * (tmp / abs(tmp));
    rec[i] = tmp;
  }
  if (judge > 0) {
    if (rec[tag] == 0) {
      rec[tag] -= x;
      k--;
    } else if (rec[tag] > 0) {
      while (rec[tag] >= 0 && k > 0) {
        k--;
        rec[tag] -= x;
      }
    } else if (rec[tag] < 0) {
      while (rec[tag] <= 0 && k > 0) {
        k--;
        rec[tag] += x;
      }
    }
  }
  priority_queue<node> pq;
  for (int i = 1; i <= n; i++) {
    node tmp;
    tmp.id = i;
    tmp.num = rec[i];
    pq.push(tmp);
  }
  while (k) {
    k--;
    node tmp = pq.top();
    pq.pop();
    if (tmp.num >= 0) {
      tmp.num += x;
      rec[tmp.id] += x;
    } else {
      tmp.num -= x;
      rec[tmp.id] -= x;
    }
    pq.push(tmp);
  }
  for (int i = 1; i <= n; i++) printf("%I64d%c", rec[i], i == n ? '\n' : ' ');
}
