Password

Jihun forgot the password of a site he rarely visits. The site keeps passwords as hashes, so it cannot tell him the old one and asks him to create a new password instead. The security policy is strict, so a password has to meet all four of these conditions.

• Its length is at least $A$.
• It contains at least $B$ digits.
• It contains at least $C$ special characters. A special character is a character that is neither a digit nor a letter.
• It contains at least $D$ uppercase letters.

Jihun picks the new password this way.

1. He writes one string of length $N$, choosing each character freely from lowercase letters, uppercase letters, digits, and the special characters !@#$%^&*()_-.
2. He inspects the contiguous substrings of that string one by one and puts into a candidate list only the ones that meet all four conditions. If the same string occurs more than once, it enters the list only once. For example, in abab the substring ab enters the list exactly once.
3. He sorts the candidate list in lexicographic order. Characters compare by their ASCII values, and when one string equals the beginning of another, the shorter one comes first.
4. If the sorted list holds $M$ candidates candidate[1], candidate[2], ..., candidate[M], he adopts the $\lfloor (M+1)/2 \rfloor$-th one as the final password.

You are given the string of length $N$ that Jihun wrote. Find the password he finally adopts.

The first line contains the integers $N$, $A$, $B$, $C$, $D$ in this order, separated by spaces.

The second line contains the string of length $N$ that Jihun wrote. It consists only of lowercase letters, uppercase letters, digits, and the special characters !@#$%^&*()_-.

Print on the first line the password Jihun finally adopts. Every given input has at least one candidate.

• $1 \le N \le 500000$
• $1 \le A \le N$
• $0 \le B, C, D \le N$