A number is non-decreasing if every digit (except the first one) is greater than or equal to previous digit. For example, 223, 4455567, 899, are non-decreasing numbers.
So, given the number of digits n, you are required to find the count of total non-decreasing numbers with n digits.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer n.
Print the count of total non-decreasing numbers with n digits for each test case in a new line.
Note: Use unsigned long long int.
1<= T <=100
1<= n <=500