#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
void fastIO() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  fastIO();
  int n, k;
  long long x, nm;
  cin >> n >> k >> x;
  char sign = '+';
  int signP = 0, signM = 0, signZ = 0;
  priority_queue<pair<long long, pair<int, char> >,
                 vector<pair<long long, pair<int, char> > >,
                 greater<pair<long long, pair<int, char> > > >
      Q;
  for (int i = 0; i < n; i++) {
    cin >> nm;
    if (nm >= 0) sign = '+', signP++;
    if (nm < 0) sign = '-', signM++;
    Q.push(make_pair(abs(nm), make_pair(i, sign)));
  }
  int used = 0;
  if (signM % 2 == 0) {
    pair<long long, pair<int, char> > cur = Q.top();
    Q.pop();
    long long val = cur.first;
    while (k > 0 && val >= 0) {
      val -= x;
      --k;
    }
    cur.first = abs(val);
    if (val < 0) {
      if (cur.second.second == '+')
        cur.second.second = '-';
      else
        cur.second.second = '+';
    }
    Q.push(cur);
  }
  while (k > 0) {
    pair<long long, pair<int, char> > cur = Q.top();
    Q.pop();
    cur.first += x;
    Q.push(cur);
    --k;
  }
  vector<long long> res(n);
  long long val = 0;
  while (!Q.empty()) {
    pair<long long, pair<int, char> > cur = Q.top();
    Q.pop();
    val = cur.first;
    if (cur.second.second == '-') val *= -1;
    res[cur.second.first] = val;
  }
  for (int i = 0; i < n; i++) cout << res[i] << " ";
  return 0;
}
