#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 100;
const long long inf = 1e18 + 100;
long double EPS = 1e-18;
const int INF = 2000000000;
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int dxx[] = {0, 0, -1, -1, -1, 1, 1, 1};
int dyy[] = {1, -1, 0, 1, -1, 0, 1, -1};
bool valid(int x, int y, int nn, int mm) {
  return (x >= 0 && y >= 0 && x < nn && y < mm);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n, k, x;
  cin >> n >> k >> x;
  long long arr[n], sgn = 1;
  set<pair<long long, int> > second;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    if (arr[i] < 0) sgn *= -1;
    second.insert({abs(arr[i]), i});
  }
  while (k--) {
    int idx = second.begin()->second;
    second.erase(second.begin());
    if (arr[idx] < 0) sgn *= -1;
    arr[idx] -= sgn * x;
    if (arr[idx] < 0) sgn *= -1;
    second.insert({abs(arr[idx]), idx});
  }
  for (int i = 0; i < n; i++) cout << arr[i] << ' ';
  return 0;
}
