#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 9;
const int INF = 1e9 + 7;
long long N, M, T, S;
long long vec[MAX_N];
priority_queue<pair<long long, int>, vector<pair<long long, int> >,
               greater<pair<long long, int> > >
    que;
int main() {
  while (cin >> N >> M >> S) {
    while (!que.empty()) que.pop();
    int num = 0;
    for (int i = 0; i < N; i++) {
      scanf("%lld", &vec[i]);
      if (vec[i] < 0) num++;
      que.push(pair<long long, int>(abs(vec[i]), i));
    }
    if (num % 2 == 0) {
      pair<long long, int> p = que.top();
      que.pop();
      int x = p.second;
      if (vec[x] >= 0) {
        while (vec[x] >= 0 && M > 0) {
          vec[x] -= S;
          M -= 1;
        }
      } else {
        while (vec[x] < 0 && M > 0) {
          vec[x] += S;
          M -= 1;
        }
      }
      que.push(pair<long long, int>(abs(vec[x]), x));
    }
    for (int i = 0; i < M; i++) {
      pair<long long, int> p = que.top();
      que.pop();
      int x = p.second;
      if (vec[x] >= 0) {
        vec[x] += S;
      } else {
        vec[x] -= S;
      }
      que.push(pair<long long, int>(abs(vec[x]), x));
    }
    for (int i = 0; i < N; i++) {
      printf("%lld ", vec[i]);
    }
    cout << endl;
  }
  return 0;
}
