#include <bits/stdc++.h>
using namespace std;
long long int mulmod(long long int a, long long int b, long long int m) {
  long long int q =
      (long long int)(((long double)a * (long double)b) / (long double)m);
  long long int r = a * b - q * m;
  if (r > m) r %= m;
  if (r < 0) r += m;
  return r;
}
template <typename T>
T MOD(T a, T b) {
  return (a < b ? a : a % b);
}
template <typename T>
T expo(T e, T n) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = x * p;
    p = p * p;
    n >>= 1;
  }
  return x;
}
template <typename T>
T power(T e, T n, T m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mulmod(x, p, m);
    p = mulmod(p, p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T gcd(T a, T b) {
  if (a % b) return gcd(b, a % b);
  return b;
}
template <typename T>
T lcm(T a, T b) {
  return (a * (b / gcd(a, b)));
}
set<pair<long long int, long long int> > s;
long long int a[200005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k, x;
  cin >> n >> k >> x;
  bool neg = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    s.insert({abs(a[i]), i});
    neg ^= (a[i] < 0);
  }
  while (k) {
    pair<long long int, long long int> p = *s.begin();
    if (neg) {
      s.erase(s.begin());
      s.insert({p.first + x, p.second});
      if (a[p.second] < 0)
        a[p.second] -= x;
      else
        a[p.second] += x;
      --k;
    } else {
      s.erase(s.begin());
      if (a[p.second] < 0) {
        while (a[p.second] <= 0 and k) a[p.second] += x, --k;
        if (a[p.second] > 0) neg = 1;
      } else {
        while (a[p.second] >= 0 and k) a[p.second] -= x, --k;
        if (a[p.second] < 0) neg = 1;
      }
      s.insert({abs(a[p.second]), p.second});
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
