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
testcases = int(raw_input())
count =0
while (testcases > count):
	stringinput = raw_input()
	if (('a' in stringinput) and ('b' in stringinput) and ('c' in stringinput) and ('d' in stringinput) and ('e' in stringinput) and ('f' in stringinput) and ('g' in stringinput) and ('h' in stringinput) and ('i' in stringinput) and ('j' in stringinput) and ('k' in stringinput) and ('l' in stringinput) and ('m' in stringinput) and ('n' in stringinput) and ('o' in stringinput) and ('p' in stringinput) and ('q' in stringinput) and ('r' in stringinput) and ('s' in stringinput) and ('t' in stringinput) and ('u' in stringinput) and ('v' in stringinput) and ('w' in stringinput) and ('x' in stringinput) and ('y' in stringinput) and ('z' in stringinput)):
		print 'YES'
	else:
		print 'NO'
	count = count +1