#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 5;
struct Node {
  long long val;
  int id;
  Node(long long val, int id) : val(val), id(id) {}
  Node() {}
  bool operator<(const Node& rhs) const { return abs(val) > abs(rhs.val); }
};
long long a[maxn];
int n, k;
long long x;
bool cmp(const Node& a, const Node& b) { return a.id < b.id; }
int main() {
  while (cin >> n >> k >> x) {
    int cnt = 0;
    priority_queue<Node> pq;
    memset(a, 0, sizeof(a));
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      pq.push(Node(a[i], i));
      if (a[i] < 0) cnt++;
    }
    for (int i = 0; i < k; i++) {
      Node u = pq.top();
      pq.pop();
      if (cnt % 2 == 1) {
        if (u.val >= 0) {
          u.val += x;
        } else {
          u.val -= x;
        }
        pq.push(u);
      } else {
        if (u.val >= 0) {
          u.val -= x;
          if (u.val < 0) cnt++;
        } else {
          u.val += x;
          if (u.val >= 0) cnt--;
        }
        pq.push(u);
      }
    }
    vector<Node> ans;
    while (!pq.empty()) {
      ans.push_back(pq.top());
      pq.pop();
    }
    sort(ans.begin(), ans.end(), cmp);
    cout << ans[0].val;
    for (int i = 1; i < n; i++) cout << " " << ans[i].val;
    cout << endl;
  }
  return 0;
}
