#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {+1, 0, -1, 0, +1, +1, -1, -1};
int dy[] = {0, +1, 0, -1, +1, -1, +1, -1};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
vector<pair<long long, long long> > pos, neg;
long long ans[201000];
long long k, x;
void increaseOp() {
  priority_queue<pair<long long, pair<int, int> >,
                 vector<pair<long long, pair<int, int> > >,
                 greater<pair<long long, pair<int, int> > > >
      store;
  for (int i = 0; i < pos.size(); ++i) {
    pair<long long, pair<int, int> > temp;
    temp.first = abs(pos[i].first);
    if (pos[i].first >= 0) temp.second.first = 1;
    temp.second.second = pos[i].second;
    store.push(temp);
    ;
  }
  for (int i = 0; i < neg.size(); ++i) {
    pair<long long, pair<int, int> > temp;
    temp.first = abs(neg[i].first);
    if (neg[i].first >= 0) temp.second.first = 1;
    temp.second.second = neg[i].second;
    store.push(temp);
  }
  while (k--) {
    pair<long long, pair<int, int> > temp = store.top();
    store.pop();
    temp.first += x;
    store.push(temp);
  }
  while (!store.empty()) {
    pair<long long, pair<int, int> > temp = store.top();
    store.pop();
    if (temp.second.first)
      ans[temp.second.second] = temp.first;
    else
      ans[temp.second.second] = -temp.first;
  }
}
void decreaseOp() {
  priority_queue<pair<long long, pair<int, int> >,
                 vector<pair<long long, pair<int, int> > >,
                 greater<pair<long long, pair<int, int> > > >
      store;
  for (int i = 0; i < pos.size(); ++i) {
    pair<long long, pair<int, int> > temp;
    temp.first = abs(pos[i].first);
    if (pos[i].first >= 0) temp.second.first = 1;
    temp.second.second = pos[i].second;
    store.push(temp);
  }
  for (int i = 0; i < neg.size(); ++i) {
    pair<long long, pair<int, int> > temp;
    temp.first = abs(neg[i].first);
    if (neg[i].first >= 0) temp.second.first = 1;
    temp.second.second = neg[i].second;
    store.push(temp);
  }
  while (k--) {
    pair<long long, pair<int, int> > temp = store.top();
    store.pop();
    temp.first -= x;
    store.push(temp);
  }
  while (!store.empty()) {
    pair<long long, pair<int, int> > temp = store.top();
    store.pop();
    if (temp.second.first)
      ans[temp.second.second] = temp.first;
    else
      ans[temp.second.second] = -temp.first;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n >> k >> x;
  for (int i = 0; i < n; ++i) {
    long long num;
    cin >> num;
    if (num < 0)
      neg.push_back(pair<int, int>(num, i));
    else
      pos.push_back(pair<int, int>(num, i));
  }
  sort(pos.begin(), pos.end());
  sort(neg.begin(), neg.end());
  if (neg.empty()) {
    if (pos[0].first - k * x <= 0) {
      while (pos[0].first >= 0 && k) {
        pos[0].first -= x;
        --k;
      }
      increaseOp();
    } else
      decreaseOp();
  } else if (pos.empty()) {
    if (n & 1) {
      increaseOp();
    } else {
      if (neg.back().first + k * x >= 0) {
        while (neg.back().first < 0 && k) {
          neg.back().first += x;
          --k;
        }
        increaseOp();
      } else
        decreaseOp();
    }
  } else if (neg.size() & 1) {
    increaseOp();
  } else {
    if (abs(neg.back().first) < pos[0].first) {
      if (neg.back().first + k * x >= 0) {
        while (neg.back().first < 0 && k) {
          neg.back().first += x;
          --k;
        }
        increaseOp();
      } else
        decreaseOp();
    } else {
      if (pos[0].first - k * x <= 0) {
        while (pos[0].first >= 0 && k) {
          pos[0].first -= x;
          --k;
        }
        increaseOp();
      } else
        decreaseOp();
    }
  };
  for (int i = 0; i < n; ++i) cout << ans[i] << " ";
  return 0;
}
