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
import sys

L=map(str, sys.stdin.read().split())

L=L[1:]

alpha='qwertyuioplkjhgfdsazxcvbnm'
for x in L:
	if len(x)<26:
		print 'NO'
	else:
		flag=True
		for y in alpha:
			if not y in x:
				flag=False
				break
		if flag:
			print 'YES'
		else:
			print 'NO'