Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Maxim and Array

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRecently Maxim has found an array of *n* integers, needed by no one. He immediately come up with idea of changing it: he invented positive integer *x* and decided to add or subtract it from arbitrary array elements. Formally, by applying single operation Maxim chooses integer *i* (1 ≤ *i* ≤ *n*) and replaces the *i*-th element of array *a*_{i} either with *a*_{i} + *x* or with *a*_{i} - *x*. Please note that the operation may be applied more than once to the same position.

Maxim is a curious minimalis, thus he wants to know what is the minimum value that the product of all array elements (i.e. ) can reach, if Maxim would apply no more than *k* operations to it. Please help him in that.

Input

The first line of the input contains three integers *n*, *k* and *x* (1 ≤ *n*, *k* ≤ 200 000, 1 ≤ *x* ≤ 10^{9}) — the number of elements in the array, the maximum number of operations and the number invented by Maxim, respectively.

The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} () — the elements of the array found by Maxim.

Output

Print *n* integers *b*_{1}, *b*_{2}, ..., *b*_{n} in the only line — the array elements after applying no more than *k* operations to the array. In particular, should stay true for every 1 ≤ *i* ≤ *n*, but the product of all array elements should be minimum possible.

If there are multiple answers, print any of them.

Examples

Input

5 3 1

5 4 3 5 2

Output

5 4 3 5 -1

Input

5 3 1

5 4 3 5 5

Output

5 4 0 5 5

Input

5 3 1

5 4 4 5 5

Output

5 1 4 5 5

Input

3 2 7

5 4 2

Output

5 11 -5

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/25/2019 01:25:32 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|