Word Power

Farmer John wants to measure the quality of the names of his $N$ ($1 \le N \le 1000$) cows. Each name is a string of at most 1000 characters, all of which are non-blank.

He has also prepared a set of $M$ ($1 \le M \le 100$) "good" strings, each at most 30 characters long and fully non-blank. A cow's name earns 1 quality point for every good string whose letters appear, in order, as a subsequence of the name — the matched letters do not have to be adjacent.

All comparisons are case-insensitive: uppercase and lowercase letters are treated as equal. For example, the name "Bessie" contains "Be", "sI", "EE", and "Es" in order, but not "is" or "eB".

Help Farmer John determine the number of quality points for each cow's name.

• Line 1: Two space-separated integers, $N$ and $M$.
• Lines 2 to $N+1$: Line $i+1$ contains the name of the $i$-th cow.
• Lines $N+2$ to $N+M+1$: Line $N+i+1$ contains the $i$-th good string.

• Lines 1 to $N$: Line $i$ contains the number of quality points of the $i$-th cow's name.

In the sample there are 5 cows named "Bessie", "Jonathan", "Montgomery", "Alicia", and "Angola", together with the 3 good strings "se", "nGo", and "Ont".

"Bessie" contains "se"; "Jonathan" contains "Ont"; "Montgomery" contains both "nGo" and "Ont"; "Alicia" contains none of the good strings; and "Angola" contains "nGo".