A short message has been compressed with a simple run-length scheme. The compressed form is a sequence of tokens written back-to-back. Each token is a positive integer count (written in ordinary base-10 decimal digits) immediately followed by exactly one lowercase English letter. A token means "repeat this letter count times". Expand the whole compressed string and print the original text.

For example the token 4a expands to aaaa. Tokens simply concatenate, so 2x1y expands to xxy.

Input format

A single line containing the compressed string. It is a non-empty concatenation of tokens, where each token is a decimal integer with no leading zeros (at least 1) followed by one lowercase letter a-z. There are no spaces.

Output format

A single line: the fully decoded string.

Constraints

• The compressed line has length between 2 and 200 characters.
• Every count is an integer with 1 <= count <= 1000 and has no leading zeros.
• The decoded string has length at most 200000.
• Only lowercase letters appear as the repeated characters.

3a2b1c

aaabbc

1a1b1c1d

abcd