#include <bits/stdc++.h>
using namespace std;
long long a[300000];
set<pair<long long, long long> > s;
int main() {
  long long n, k, x, z = 0, neg = 0, ind = 0;
  cin >> n >> k >> x;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    s.insert(make_pair(abs(a[i]), i));
    if (a[i] == 0) {
      z++;
      ind = i;
    }
    if (a[i] < 0) neg++;
  }
  if (z > k) {
    a[0] -= k * x;
    for (long long i = 0; i < n; i++) cout << a[i] << " ";
    return 0;
  }
  if (z == 0 && neg % 2 == 0) {
    pair<long long, long long> h = *s.begin();
    if (a[h.second] > 0)
      while (a[h.second] >= 0 && k > 0) {
        a[h.second] -= x;
        k--;
      }
    else
      while (a[h.second] <= 0 && k > 0) {
        a[h.second] += x;
        k--;
      }
    s.erase(h);
    s.insert(make_pair(abs(a[h.second]), h.second));
  }
  for (long long i = 0; i < k; i++) {
    pair<long long, long long> tmp = *s.begin();
    if (a[tmp.second] <= 0)
      a[tmp.second] -= x;
    else
      a[tmp.second] += x;
    s.erase(tmp);
    s.insert(make_pair(abs(a[tmp.second]), tmp.second));
  }
  if ((z + neg) % 2 == 0 && neg != 0 && z != 0) {
    a[ind] *= (-1);
  }
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  return 0;
}
