Wave Transform

You are given a string s. Your task is to generate a series of transformations of the string. For each position i in the string where the character s[i] is an alphabet letter, form a new string by converting only that letter to uppercase while keeping the rest of the string unchanged.

The transformation for a valid index i is given by the formula:

$$T(s, i) = s[0:i] + \text{uppercase}(s[i]) + s[i+1:] $$

If the input string contains no alphabetical characters, output nothing.

inputFormat

The input consists of a single line containing the string s.

outputFormat

For each valid transformation, output the resulting string on a separate line, in the order of appearance in the input.

## sample

hello

Hello
hEllo
heLlo
helLo
hellO

</p>