Problem Statement Mr. Agoji is given a shuffled string made by randomly shuffling a special string. A sting will be called special only if it is formed by joining some special words any number of times. Special words are mapping of numbers (0 <= number < 10) to their words, for example, mapping of ‘0’ to ‘zero’, mapping of ‘1’ to ‘one’, and so on. Mr. Agoji is asked to convert the shuffled string to the smallest special number. A special number is a number formed using numbers (0 <= number < 10) without any leading zeroes. Mr. Agoji being not so good with numbers and strings ask for your help. Input Format The first line of the input will contain T, the number of test cases, 1 <= T <= 100 For each test case, There will be a, s shuffled string, on a separate line 1 <= s.length <= 100000 Output Format For each test case, on the new line, the Smallest special number is in the string format. Some notes on output: Shuffled string will always be able to convert ...