##### Trouble spelling

Jimmy is horibl at spelingg, and he has asked you to help him practice his spelling. In each test case you will be given a word that is spelt correctly and N of Jimmy's attempts to spell that word. Since he is so bad at spelling, you should be more lenient with your grading and mark an attempt as correct if he either spelled it correcly or if you are able to rearrange the letters to form the correctly spelled word.

##### Constraints

1 ≤ N ≤ 50

1 ≤ M ≤ 2 x 10^4

For 30% of the points, 1 ≤ N, M ≤ 10

##### Input Specification

The first line will contain two integers, N (The number of attempts Jimmy made to spell the word) and M (The length of the correctly spelt word)

The next line will contain the correctly spelt word.

The next N lines will contain one of Jimmy's attempts to spell the word.

All of Jimmy's attempts have the same number of characters as the correctly spelt word.

##### Output Specification

For each of Jimmy's attempts, if the attempt is "correct" then print yes otherwise, print no. Do this on separate lines.

##### Sample Input 1

4 7 puddingabcdefgidontknpuddinggniddup

##### Output for Sample Case 1

nonoyesyes

##### Explanation for Sample Case 1

Jimmy's first two tries to spell pudding were completely wrong, but he spells it correctly in the third attempt, and in the fourth attempt, he spelt it backwards but you should mark it right anyway.