Given a string s consists of lower case English alphabets or digits. The task is to replace each occurrence of digit with '*' or '@' or '!'. The task is to print all possible distinct strings in lexicographical order with space separation.
Note: ASCII value of '!' less than '*' and ASCII value of '*' is less than '@'
1. The first line of the input contains a single integerT denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a string s.
Output: For each test case, print all possible distinct strings in lexicographical order with space separation
1. 1 <= T <= 3 2. 1<= size of string <= 10