Send me the money

Seokgyu wants to send money to Hyeongdong, who is visiting the kingdom of CTP, with an overseas remittance service. He forgot the password for the service, so the transfer is stuck.

Seokgyu writes his passwords on sticky notes. The password is made of uppercase letters only, and Seokgyu remembers $N$ of its letters exactly, in the order they appear.

The trouble is that he has several sticky notes and does not know which one holds the password. If the string written on a note contains all $N$ remembered letters in that order, the note can be the one with the password. In other words, the remembered string is a subsequence of the string on the note.

For example, if Seokgyu remembers ABB, a note reading BBAB cannot be the password, while a note reading HAEBBC can.

You are given the $N$ letters Seokgyu remembers and $M$ sticky notes. Decide for each note whether it can be the password.

The first line contains the number of remembered letters $N$ ($1 \le N \le 100$) and the number of sticky notes $M$ ($1 \le M \le 1000$).

The second line contains a string $S$ of length $N$ made of uppercase letters.

Each of the next $M$ lines contains the string on one sticky note. Every such string is made of uppercase letters and is at most 1000 characters long.

Print $M$ lines. For each sticky note, in input order, print true if it can be the password and false otherwise.