#include <bits/stdc++.h>
const double pi = 4.0 * atan(1.0);
const double e = exp(1.0);
using namespace std;
struct qr {
  long long x;
  int id;
} rt[200005];
bool operator<(qr a, qr b) { return abs(a.x) > abs(b.x); }
priority_queue<qr> que;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, x;
  qr temp;
  int flage = 1;
  cin >> n >> k >> x;
  for (int i = 1; i <= n; i++) {
    cin >> rt[i].x;
    rt[i].id = i;
    que.push(rt[i]);
    if (rt[i].x < 0) {
      flage = -flage;
    }
  }
  while (k--) {
    temp = que.top();
    que.pop();
    if (temp.x < 0) {
      if (flage < 0) {
        rt[temp.id].x -= x;
      } else {
        rt[temp.id].x += x;
      }
      if (rt[temp.id].x >= 0) flage = -flage;
    } else {
      if (flage < 0) {
        rt[temp.id].x += x;
      } else {
        rt[temp.id].x -= x;
      }
      if (rt[temp.id].x < 0) {
        flage = -flage;
      }
    }
    que.push(rt[temp.id]);
  }
  for (int i = 1; i <= n; i++) {
    cout << rt[i].x << " ";
  }
}
