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
mydict={
	"a":0,
	"b":1,
	"c":2,
	"d":3,
	"e":4,
	"f":5,
	"g":6,
	"h":7,
	"i":8,
	"j":9,
	"k":10,
	"l":11,
	"m":12,
	"n":13,
	"o":14,
	"p":15,
	"q":16,
	"r":17,
	"s":18,
	"t":19,
	"u":20,
	"v":21,
	"w":22,
	"x":23,
	"y":24,
	"z":25,
	}
		
lettercount = int(raw_input())
for each in range(lettercount):
	
	letters = raw_input()
	if len(letters)<26:
		print "NO"
		continue
	isexists=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
	
	for each in letters:
		isexists[mydict[each]]=1
	if 0 in isexists:
		print "NO"
	else:
		print "YES"