Problem Statement

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. Out