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
for i in range(input()):
	z=raw_input()
	k=[]
	f=[]
	for i in z:
		k.append(i)
	k=set(k)
	k=sorted(k)
	ans="".join(str(x) for x in k)
	f.append(ans)
	bans='abcdefghijklmnopqrstuvwxyz'
	f.append(bans)
	if(f[0]==f[1]):
		print "YES"
	else:
		print "NO"