Lesha 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.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'n,A,cf,cm,mN = list(map(int,input().split()))\n\na = list(map(int,input().split()))\naCOPY = []\nfor elem in a:\n    aCOPY.append(elem)\na.sort()\n\naPartialSum = [0]\n\nfor elem in a:\n    aPartialSum.append(aPartialSum[-1] + elem)\n\nmaxScore = 0\nansMAXIBound = 0\nansMAXI = 0\nansMIN = 0\nfor MAXI in range(n + 1):\n    currentScore = cf * MAXI\n    if MAXI >= 1:\n        mN -= (A - a[-MAXI])\n    if mN < 0:\n        break\n    if MAXI == n:\n        maxScore = currentScore + A * cm\n        ansMAXIBound = 0\n        ansMAXI = 10 ** 10\n        ansMIN = 0\n    # Find the maximum of minimum\n    l = a[0]\n    r = A - 1\n\n    while l < r:\n        m = (l + r + 1) // 2\n        lA = 0\n        rA = n - MAXI - 1\n        while lA < rA:\n            mA = (lA + rA) // 2\n            if a[mA] > m:\n                rA = mA - 1\n            if a[mA] < m:\n                lA = mA + 1\n            if a[mA] == m:\n                lA = mA\n                rA = mA\n                break\n        lA = min(lA,n - MAXI - 1)\n        if a[lA] > m:\n            lA -= 1\n        expenditure = (lA + 1) * m - aPartialSum[lA + 1]\n        if expenditure > mN:\n            r = m - 1\n        else:\n            l = m\n    currentScore += l * cm\n    if currentScore > maxScore:\n        maxScore = currentScore\n        ansMAXIBound = a[-MAXI]\n        ansMAXI = MAXI\n        ansMIN = l\n\nprint(maxScore)\ninclCount = 0\nfor i in range(n):\n    if aCOPY[i] > ansMAXIBound and inclCount < ansMAXI:\n        aCOPY[i] = A\n        inclCount += 1\nfor i in range(n):\n    if aCOPY[i] == ansMAXIBound and inclCount < ansMAXI:\n        aCOPY[i] = A\n        inclCount += 1\n    if aCOPY[i] < ansMIN:\n        aCOPY[i] = ansMIN\nprint(" ".join(map(str,aCOPY)))\n\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14011