A problem set ordering is considered wellindexed if the first letter of the title of the problem is the same as its index. For example, if the title of the problem is Wellindexed?
, its index must be W
(the $23$rd problem).
As you can see, the problem set of JCPC 2019 is not wellindexed as it contains less than $23$ problems.
Indexing of a set of problems is done uniquely starting from A
for the first problem, B
for the second problem, and so on.
You are given the first letter of the titles of $13$ problems. Determine if it is possible to rearrange the problems such that the ordering of the problem set is wellindexed.
The first line of input contains a single integer $T$ ($1 \le T \le 2 \times 10^4$), the number of test cases.
Each of the following $T$ lines contains a string of $13$ uppercase English letters, each letter is the first letter in the title of one of the problems.
For each test case, print a single line containing yes
if it is possible to rearrange the problems such that the ordering of the problem set is wellindexed. Otherwise, print no
. The output is case insensitive.
Input  Output 

4 ABCDEFGHIJKLM MGJAIEDKLBHFC UTFBRNJDHZPSQ NCCDFFWVRSMMS Copy

YES YES NO NO Copy
