You are given n identifiers written in snake_case (lowercase letters, digits, and underscores). For each one, convert it to lowerCamelCase: treat any run of one or more underscores as a single word separator, keep the first word exactly as-is, and for every subsequent word capitalize only its first character (the rest of that word keeps its original case) before concatenating all words with no separator. Leading or trailing underscores contribute no extra (empty) words. An identifier made up entirely of underscores converts to an empty string.

Input format

Line 1: an integer n. Lines 2..n+1: one identifier per line, each consisting only of lowercase letters, digits, and underscores (a line may be empty).

Output format

n lines: the camelCase conversion of each identifier, in the same order as the input.

Constraints

• 1 ≤ n ≤ 1000
• 0 ≤ length of each identifier ≤ 200

2
user_first_name
id

userFirstName
id

1
__a__b__

aB