Given a list of sentences, for each sentence, determine if it is a pangram or not.
pangrams are sentences constructed by using every letter of the alphabet at least once.

For example: How quickly daft jumping zebras vex

Input
The first line contains T, the number of test cases.
The following lines will contain the sentences.

Output
You have to print TRUE if a given sentence is a pangram else print FALSE
Constraints:
1 <= T <= 100
1 <= Length of the sentence <= 200

Example
Input:
2
How quickly daft jumping zebras vex
what are you doing

Output:
TRUE
FALSE

见题面

见题面