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
#Panagram
t=input()
while t:
    c=0
    s=raw_input().lower()
    alpha=[]
    alphabet =['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
    for i in s:
        if(i in alphabet):
            c+=1
            ch=i
            alpha.append(ch)
            del alphabet[alphabet.index(ch)]
    if(c==26):
        print "YES"
    else:
        print "NO"
    t=t-1
    alphabet=alpha+alphabet