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
'''
# Read input from stdin and provide input before running code


print 'Hi, %s.' % name
'''
from string import ascii_lowercase

num = int(raw_input())
for x in range (0,num):
	string =raw_input()
	flag=True
	if len(string)<26:
		print 'NO'
	else :
		for c in ascii_lowercase:
			if c not in string:
				flag=False
				break
		if flag==False:
			print 'NO'
		else:
			print 'YES'