Big Daddy the beginner programmer has a string s composed of lowercase alphabets and digits but Big Daddy is only interested in numbers.
Since, the string s is large and Big Daddy is busy with his own work so he asks you to find the count of unique non-negative integers in the string s.
Look at the sample test cases for more details.
Input
The first line contains an integer t denoting the total number of test cases.
Each of the next t lines contains a string s.
Output
For each test case, print an integer denoting the number of unique numbers in the string.
Constraints
1≤q≤10
1≤|s|≤105
In the first test case, the number of unique numbers are {1, 2, 3, 4, 5}.
In the second test case, the number of unique numbers are {11, 22}.
In the third test case, the number of unique numbers are {123}.
