#include <bits/stdc++.h>
const int MAX_N = (int)2e5 + 123;
const int inf = (int)1e9 + 123;
using namespace std;
set<pair<long long, long long> > first, second;
vector<long long> z;
long long n, k, x;
long long a[MAX_N];
long long ans[MAX_N];
int main() {
  cin >> n >> k >> x;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] > 0)
      first.insert(make_pair(a[i], i));
    else if (a[i] == 0)
      z.push_back(i);
    else
      second.insert(make_pair(-a[i], i));
  }
  while (k > 0 && !z.empty()) {
    k--;
    long long val = z.back();
    z.pop_back();
    if (int((second).size()) % 2 == 0)
      second.insert(make_pair(x, val));
    else
      first.insert(make_pair(x, val));
  }
  if (int((second).size()) % 2 == 0 && k > 0) {
    bool tp = 0;
    if (second.empty() ||
        (!first.empty() && second.begin()->first > first.begin()->first))
      tp = 1;
    if (!tp) {
      pair<long long, long long> now = *second.begin();
      second.erase(second.begin());
      long long mini = min(k * 1ll, now.first / x + 1);
      now.first -= mini * x;
      k -= mini;
      if (now.first < 0)
        first.insert(make_pair(-now.first, now.second));
      else if (now.first == 0)
        z.push_back(now.second);
      else
        second.insert(now);
    } else {
      pair<long long, long long> now = *first.begin();
      first.erase(first.begin());
      long long mini = min(k * 1ll, now.first / x + 1);
      now.first -= mini * x;
      k -= mini;
      if (now.first < 0)
        second.insert(make_pair(-now.first, now.second));
      else if (now.first == 0)
        z.push_back(now.second);
      else
        first.insert(now);
    }
  }
  while (k > 0) {
    k--;
    if (!second.empty() &&
        (first.empty() || second.begin()->first <= first.begin()->first)) {
      pair<long long, long long> now = *second.begin();
      second.erase(second.begin());
      now.first += x;
      second.insert(now);
    } else {
      pair<long long, long long> now = *first.begin();
      first.erase(first.begin());
      now.first += x;
      first.insert(now);
    }
  }
  for (auto i : first) ans[i.second] = i.first;
  for (auto i : second) ans[i.second] = -i.first;
  for (auto i : z) ans[i] = 0;
  for (int i = 1; i <= n; i++) printf("%lld ", ans[i]);
  return 0;
}
