#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k, x;
  cin >> n >> k >> x;
  vector<long long int> v1(n);
  for (auto &it : v1) cin >> it;
  long long int neg = 0;
  long long int pos = 0;
  for (long long int i = 0; i <= n - 1; i++) {
    if (v1[i] < 0)
      neg++;
    else
      pos++;
  }
  vector<long long int> v2(n);
  if (neg % 2 == 0) {
    for (long long int i = 0; i <= n - 1; i++) v2[i] = abs(v1[i]);
    long long int a1 = distance(v2.begin(), min_element(v2.begin(), v2.end()));
    if (v1[a1] >= 0) {
      while (1) {
        if (v1[a1] < 0 || k == 0) break;
        v1[a1] -= x;
        k--;
      }
    } else if (v1[a1] < 0) {
      while (1) {
        if (v1[a1] > 0 || k == 0) break;
        v1[a1] += x;
        k--;
      }
    }
  }
  for (long long int i = 0; i <= n - 1; i++) v2[i] = abs(v1[i]);
  multimap<long long int, long long int> m1;
  for (long long int i = 0; i <= n - 1; i++) m1.insert(make_pair(v2[i], i));
  for (long long int i = 0; i <= k - 1; i++) {
    multimap<long long int, long long int>::iterator itr;
    itr = m1.begin();
    long long int a1 = itr->first;
    long long int a2 = itr->second;
    m1.erase(itr);
    m1.insert(make_pair(a1 + x, a2));
  }
  multimap<long long int, long long int> m2;
  vector<long long int> ans;
  for (auto &it : m1) m2.insert(make_pair(it.second, it.first));
  for (auto &it : m2) ans.push_back(it.second);
  for (long long int i = 0; i <= n - 1; i++)
    if (v1[i] < 0) ans[i] *= -1;
  for (long long int i = 0; i <= n - 1; i++) cout << ans[i] << " ";
}
