#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<pair<long long int, int>, int>,
               vector<pair<pair<long long int, int>, int> >,
               greater<pair<pair<long long int, int>, int> > >
    q;
pair<pair<long long int, int>, int> temp;
long long int ans[200010];
int main() {
  ios_base::sync_with_stdio(false);
  int n, k, neg = 0;
  long long int x, a;
  cin >> n >> k >> x;
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (a < 0) {
      neg++;
      q.push(make_pair(make_pair(abs(a), 0), i));
    } else
      q.push(make_pair(make_pair(abs(a), 1), i));
  }
  if (neg % 2 == 0) {
    temp = q.top();
    q.pop();
    while (temp.first.first >= 0 && k) {
      k--;
      temp.first.first -= x;
    }
    if (temp.first.first >= 0)
      q.push(temp);
    else
      q.push(make_pair(make_pair(abs(temp.first.first), 1 - temp.first.second),
                       temp.second));
  }
  while (k) {
    k--;
    temp = q.top();
    q.pop();
    q.push(make_pair(make_pair(temp.first.first + x, temp.first.second),
                     temp.second));
  }
  while (!q.empty()) {
    temp = q.top();
    q.pop();
    if (temp.first.second == 0)
      ans[temp.second] = (-1) * temp.first.first;
    else
      ans[temp.second] = temp.first.first;
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << "\n";
  return 0;
}
