#include <bits/stdc++.h>
using namespace std;
int n, k;
long long a[200005], x;
struct heap {
  long long data;
  int indx;
} h[200005];
void heapify(int i) {
  int l, r, s;
  long long tmp;
  l = 2 * i + 1;
  r = 2 * i + 2;
  s = i;
  if (l < n && h[l].data < h[i].data) s = l;
  if (r < n && h[r].data < h[s].data) s = r;
  if (s != i) {
    tmp = h[i].data;
    h[i].data = h[s].data;
    h[s].data = tmp;
    tmp = h[i].indx;
    h[i].indx = h[s].indx;
    h[s].indx = tmp;
    heapify(s);
  }
}
void build() {
  for (int i = 0; i < n; i++) {
    h[i].data = llabs(a[i]);
    h[i].indx = i;
  }
  for (int i = n / 2 - 1; i >= 0; i--) heapify(i);
}
int main() {
  int z = 0, ng = 0;
  scanf("%d%d%I64d", &n, &k, &x);
  for (int i = 0; i < n; i++) scanf("%I64d", &a[i]);
  for (int i = 0; i < n; i++) {
    if (a[i] < 0)
      ng++;
    else if (a[i] == 0)
      z++;
  }
  if (z != 0) {
    if (ng % 2 == 0) {
      for (int i = 0; i < n; i++) {
        if (a[i] == 0) {
          a[i] = -1 * x;
          ng++;
          k--;
          z--;
          break;
        }
      }
    }
    if (k < z) {
      for (int i = 0; i < n; i++) printf("%I64d ", a[i]);
      return 0;
    } else {
      for (int i = 0; i < n; i++) {
        if (a[i] == 0) {
          a[i] = x;
          k--;
          z--;
        }
      }
    }
  }
  build();
  if (ng % 2 == 0) {
    int s = 1, in;
    in = h[0].indx;
    s = s * (a[in] / llabs(a[in]));
    while (k) {
      if (x > h[0].data) {
        s = -1 * s;
        h[0].data = x - h[0].data;
        a[in] = s * h[0].data;
        k--;
        break;
      } else {
        h[0].data = h[0].data - x;
        a[in] = s * h[0].data;
        k--;
      }
    }
  }
  heapify(0);
  while (k) {
    int in = h[0].indx, s;
    s = a[in] / llabs(a[in]);
    h[0].data += x;
    a[in] = s * h[0].data;
    k--;
    heapify(0);
  }
  for (int i = 0; i < n; i++) printf("%I64d ", a[i]);
  return 0;
}
