Problem2368--CF1703A - YES or YES?

2368: CF1703A - YES or YES?

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

Description

There is a string ss of length 33, consisting of uppercase and lowercase English letters. Check if it is equal to "YES" (without quotes), where each letter can be in any case. For example, "yES", "Yes", "yes" are all allowable.

Input

The first line of the input contains an integer tt (1≤t≤1031≤t≤103) — the number of testcases.

The description of each test consists of one line containing one string ss consisting of three characters. Each character of ss is either an uppercase or lowercase English letter.

Output

For each test case, output "YES" (without quotes) if ss satisfies the condition, and "NO" (without quotes) otherwise.

You can output "YES" and "NO" in any case (for example, strings "yES", "yes" and "Yes" will be recognized as a positive response).

Sample Input Copy

10
YES
yES
yes
Yes
YeS
Noo
orZ
yEz
Yas
XES

Sample Output Copy

YES
YES
YES
YES
YES
NO
NO
NO
NO
NO

HINT

Note

The first five test cases contain the strings "YES", "yES", "yes", "Yes", "YeS". All of these are equal to "YES", where each character is either uppercase or lowercase.

Source/Category