Micro has made a new search algorithm. What it does is check whether the query string is a subsequence of the search string or not. A string $$A$$ is considered a subsequence of string $$B$$ if some characters from $$B$$ can be deleted so that it becomes equal to $$A$$.
Micro ran his algorithm on a list of messages he has and got some output but now he needs to verify it. Help Micro verify the output by doing a search on the same list of messages. String he queried for is "hack" (without quotes).
Table : Messages
Note: Output should be printed in increasing order of id.
All strings in Content field consists of lower case English alphabets.
String "hack" appears as a subsequence in strings "hacker" and "hacak".