Grace Hopper and the literal moth found in the Harvard Mark II computer. While working on this massive electromechanical machine, Hopper's team discovered a real insect trapped in a relay, causing the system to fail. They removed the physical moth and taped it into their logbook, a legendary event that helped popularize the term "debugging" in computer science. Her legacy reminds us to always check our systems meticulously.

Grace is inspecting a reel of punch tape represented by a string S consisting of English letters.

A tape is considered "buggy" if it contains the continuous substring moth. Thus, Grace needs to know if the letters m, o, t, h appear in that exact order (contiguously) regardless of whether they are uppercase or lowercase.

Given the string S, determine if the tape is buggy.

Input Format

The first line of input contains a single integer T, denoting the number of test cases.
The only line of each test case contains a single string S representing the punch tape.

Output Format

For each test case, print YES if the string contains at least one bug, and NO otherwise. Print each answer on its own line, in uppercase exactly as shown.

Constraints

1 <= T <= 100
1 <= |S| <= 10⁵
The sum of |S| over all test cases will not exceed 2 · 10⁵.
S consists only of uppercase and lowercase English letters.

Sample Input

4
AXmOtHXa
mot
Mothra
htom

Sample Output

YES
NO
YES
NO

Explanation

Test Case 1: The string contains mOtH contiguously. Since we do not care about the upper or lowercase difference, this matches the target bug, so the output is YES.
Test Case 2: The string mot is missing the h, so the output is NO.
Test Case 3: The string Mothra starts with Moth, which matches the contiguous target substring, so the output is YES.
Test Case 4: The string htom contains the correct letters but not in the correct order, so the output is NO.