A string is said to be complete if it contains all the characters from a to z. Given a string, check if it complete or not.

Input
First line of the input contains the number of strings N. It is followed by N lines each contains a single string.

Output
For each test case print "YES" if the string is complete, else print "NO"

Constraints
1 ≤ N ≤ 10
The length of the string is at max 100 and the string contains only the characters a to z

SAMPLE INPUT
3
wyyga
qwertyuioplkjhgfdsazxcvbnm
ejuxggfsts

SAMPLE OUTPUT
NO
YES
NO
#!/usr/bin/python
str="abcdefghijklmnopqrsatuvwxyz"
str_arr = []
n = int(raw_input(""))
for count in range(0,n):
        line = raw_input()        
        str_arr.append(line)
for x in str_arr:
        if len(x)<26:
                print('NO')
        elif len(x)>=26:
                for i,c in enumerate(str):
                        if c not in x:
                                print('NO')
                                break
                if c == 'z':
                        print('YES')
                else:  
                        continue
                
        else:
                print('NO')