Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
B. Skills

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLesha plays the recently published new version of the legendary game hacknet. In this version character skill mechanism was introduced. Now, each player character has exactly *n* skills. Each skill is represented by a non-negative integer *a*_{i} — the current skill level. All skills have the same maximum level *A*.

Along with the skills, global ranking of all players was added. Players are ranked according to the so-called Force. The Force of a player is the sum of the following values:

- The number of skills that a character has perfected (i.e., such that
*a*_{i}=*A*), multiplied by coefficient*c*_{f}. - The minimum skill level among all skills (
*min**a*_{i}), multiplied by coefficient*c*_{m}.

Now Lesha has *m* hacknetian currency units, which he is willing to spend. Each currency unit can increase the current level of any skill by 1 (if it's not equal to *A* yet). Help him spend his money in order to achieve the maximum possible value of the Force.

Input

The first line of the input contains five space-separated integers *n*, *A*, *c*_{f}, *c*_{m} and *m* (1 ≤ *n* ≤ 100 000, 1 ≤ *A* ≤ 10^{9}, 0 ≤ *c*_{f}, *c*_{m} ≤ 1000, 0 ≤ *m* ≤ 10^{15}).

The second line contains exactly *n* integers *a*_{i} (0 ≤ *a*_{i} ≤ *A*), separated by spaces, — the current levels of skills.

Output

On the first line print the maximum value of the Force that the character can achieve using no more than *m* currency units.

On the second line print *n* integers *a*'_{i} (*a*_{i} ≤ *a*'_{i} ≤ *A*), skill levels which one must achieve in order to reach the specified value of the Force, while using no more than *m* currency units. Numbers should be separated by spaces.

Examples

Input

3 5 10 1 5

1 3 1

Output

12

2 5 2

Input

3 5 10 1 339

1 3 1

Output

35

5 5 5

Note

In the first test the optimal strategy is to increase the second skill to its maximum, and increase the two others by 1.

In the second test one should increase all skills to maximum.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/27/2023 16:43:20 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|