You are given a string \(S\) in the camel case format. Your task is to convert this string into the snake case format.

Examples of the camel case strings are as follows:

• ComputerHope
• FedEx
• WordPerfect

Note: In the camel case string, the first character may or may not be capitalized.

Examples of the snake case strings are as follows:

• computer_hope
• fed_ex
• word_perfect

Input format

• First line: \(T\) denotes the number of test cases
• Next \(T\) lines: String \(S\)

Output format
For each test case, print the snake case format of the given camel case in the string \(S\) in a new line.

Constraints

\( 1 \le T \le 100 \)

\( 1 \le |S| \le 100 \), where \(|S|\) indicates the length of string \(S\)

String \(S\) is made of lower and upper case English alphabets