#include <bits/stdc++.h>
using namespace std;
struct num {
  long long value;
  bool sign;
  int idx;
  num(long long v, bool s, int i) : value(v), sign(s), idx(i) {}
};
bool operator<(num const& a, num const& b) { return a.idx < b.idx; }
struct compare {
  bool operator()(num const& a, num const& b) { return a.value > b.value; }
};
int main() {
  priority_queue<num, vector<num>, compare> q;
  long long n, k, x;
  cin >> n >> k >> x;
  int neg = 0;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] < 0) neg++;
  }
  for (int i = 0; i < n; i++) q.push(num(abs(a[i]), (a[i] < 0 ? 1 : 0), i));
  while (k--) {
    num cur = q.top();
    q.pop();
    if (neg % 2 == 0) {
      cur.value -= x;
      if (cur.value < 0) {
        cur.sign = !cur.sign;
        cur.value = abs(cur.value);
        neg++;
      }
    } else
      cur.value += x;
    q.push(cur);
  }
  set<num> res;
  while (!q.empty()) {
    num cur = q.top();
    q.pop();
    res.insert(cur);
  }
  for (num e : res) {
    if (e.sign)
      cout << e.value * -1 << " ";
    else
      cout << e.value << " ";
  }
  cout << endl;
}
