Pangram Checker

A pangram is a sentence that contains every letter of the English alphabet at least once. In this problem, you are given several strings and you need to determine whether each string is a pangram. Formally, a string S is a pangram if it contains every letter from \(a\) to \(z\) at least once.

Your task is to check each provided string and output "YES" if it is a pangram and "NO" otherwise.

inputFormat

The first line of input contains an integer T representing the number of test cases. Each of the following T lines contains a single string, which may include spaces and punctuation.

All input should be read from standard input (stdin).

outputFormat

For each test case, output a single line: "YES" if the corresponding string is a pangram, or "NO" otherwise. The output should be written to standard output (stdout).

## sample

2
The quick brown fox jumps over the lazy dog
Hello World

YES
NO

</p>