PROGRAMMING:Find words
Suppose there are X1 letters a, X2 Letters B,... X26 letters Z, and suppose the value of letter A is 1, the value of letter B is 2,... The value of letter Z is 26. So, for a given letter, how many words with a value of < = 50 can be found? The value of a word is the sum of the values of all the letters that make up a word. For example, the value of ACM is 1 + 3 + 14 = 18, and the value of HDU is 8 + 4 + 21 = 33（ For example, ACM and CMA think that they are the same word).
###Input format:
The first input is an integer n, which represents the number of test cases.
Then n rows of data are included, each row contains 26 integers x1, X2,... X26 < = 20
###Output format:
For each test instance, please output the number of words whose total value is less than or equal to 50, and the output of each instance accounts for one line.
###Input example:
```in
two
1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
9 2 6 2 10 2 2 5 6 1 0 2 7 0 2 2 7 5 10 6 10 2 10 6 1 9
```
###Output example:
The corresponding output is given here. For example:
```out
seven
three hundred and seventy-nine thousand two hundred and ninety-seven
```
answer：If there is no answer, please comment
###Input format:
The first input is an integer n, which represents the number of test cases.
Then n rows of data are included, each row contains 26 integers x1, X2,... X26 < = 20
###Output format:
For each test instance, please output the number of words whose total value is less than or equal to 50, and the output of each instance accounts for one line.
###Input example:
```in
two
1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
9 2 6 2 10 2 2 5 6 1 0 2 7 0 2 2 7 5 10 6 10 2 10 6 1 9
```
###Output example:
The corresponding output is given here. For example:
```out
seven
three hundred and seventy-nine thousand two hundred and ninety-seven
```
answer：If there is no answer, please comment