#include <bits/stdc++.h>
using namespace std;
long long sign(long long x) {
  if (x > 0) {
    return 1;
  } else if (x < 0) {
    return -1;
  }
  return 0;
}
void solve(vector<long long>& xs, long long k, long long x) {
  priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
                 greater<pair<long long, long long>>>
      que;
  long long sgn = 1;
  for (long long i = 0; i < xs.size(); ++i) {
    que.push({abs(xs[i]), i});
    if (xs[i] < 0) {
      sgn *= -1;
    }
  }
  if (sgn == 1) {
    auto t = que.top();
    que.pop();
    long long i = t.second;
    if (xs[i] >= 0) {
      while (k > 0 && xs[i] >= 0) {
        xs[i] -= x;
        --k;
      }
    } else {
      while (k > 0 && xs[i] <= 0) {
        xs[i] += x;
        --k;
      }
    }
    que.push({abs(xs[i]), i});
  }
  while (k > 0) {
    auto t = que.top();
    que.pop();
    auto i = t.second;
    xs[i] += (xs[i] >= 0 ? x : -x);
    que.push({abs(xs[i]), i});
    --k;
  }
}
int main() {
  while (true) {
    long long n, k, x;
    cin >> n >> k >> x;
    if (!cin) {
      break;
    }
    vector<long long> xs(n, 0);
    for (long long i = 0; i < n; ++i) {
      cin >> xs[i];
    }
    solve(xs, k, x);
    for (long long i = 0; i < xs.size(); ++i) {
      cout << xs[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
