Digit Combination
Easy Accuracy: 63.71% Submissions: 361 Points: 2

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 '@'

Input:
1. The first line of the input contains a single integer T 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

Constraints:
1. 1 <= T <= 3

2. 1<= size of string <= 10

Example:
Input:

2
a1b2
abcdef

Output:
a!b! a!b* a!b@ a*b! a*b* a*b@ a@b! a@b* a@b@
abcdef

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Digit Combination

Output Window