Prefix Counting Problem

Given N strings S₁, S₂, …, S_N, followed by M queries.

Each query provides a string T, and you need to count how many of the N strings are prefixes of T.

The total length of all input strings (S_i and T) does not exceed 10⁶.
All strings contain only lowercase English letters.

Input Format

• The first line contains two integers N and M.
• The next N lines each contain one string S_i.
• The following M lines each contain one query string T.

Output Format
For each query, output an integer — the number of S_i strings that are prefixes of the current T.
Print each answer on a separate line.

Data Range
1 ≤ N, M ≤ 10⁵

Sample Input

3 2
ab
bc
abc
abc
efg

Sample Output

2
0