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
alpha='abcdefghijklmnopqrstuvwxyz'
t=input()
for i in range(t):
	s=raw_input()
	d={}.fromkeys(alpha,0)
	for j in s:
		if j in d:
			d[j]+=1
	count=0
	for k in d:
		if d[k]>=1:
			count+=1
	if count==26:
		print"YES"
	else:
		print "NO"