Smith wakes up at the side of a dirty, disused bathroom, his ankle chained to pipes. Next to him is tape-player with a hand-written message "Play Me". He finds a tape in his own back pocket. After putting the tape in the tape-player, he sees a key hanging from a ceiling, chained to some kind of a machine, which is connected to the terminal next to him. After pressing a Play button a rough voice starts playing from the tape:

"Listen up Smith. As you can see, you are in pretty tough situation and in order to escape, you have to solve a puzzle. 

You are given N strings which represent words. Each word is of the maximum length L and consists of characters 'a'-'e'. You are also given M strings which represent patterns. Pattern is a string of length  ≤ L and consists of characters 'a'-'e' as well as the maximum 3 characters '?'. Character '?' is an unknown character, meaning it can be equal to any character 'a'-'e', or even an empty character. For each pattern find the number of words that matches with the given pattern. After solving it and typing the result in the terminal, the key will drop from the ceiling and you may escape. Let the game begin."

Help Smith escape.

Input

The first line of input contains two integers N and M (1 ≤ N ≤ 100 000, 1 ≤ M ≤ 5000), representing the number of words and patterns respectively.

The next N lines represent each word, and after those N lines, following M lines represent each pattern. Each word and each pattern has a maximum length L (1 ≤ L ≤ 50). Each pattern has no more that three characters '?'. All other characters in words and patters are lowercase English letters from 'a' to 'e'.

Output

Output contains M lines and each line consists of one integer, representing the number of words that match the corresponding pattern.

Example

Input

3 1
abc
aec
ac
a?c


Output

3

Note

If we switch '?' with 'b', 'e' and with empty character, we get 'abc', 'aec' and 'ac' respectively.
#include <bits/stdc++.h>
using namespace std;
int n, m, x, a, b, ans;
bool tag[52];
char s[52];
map<pair<int, int>, int> S;
set<pair<int, int> > T;
inline void dfs(int no) {
  if (no == x + 1) {
    a = b = 0;
    for (int i = 1; i <= x; i++)
      if (!tag[i])
        a = (19260817ll * a + s[i] * 233) % 1000000007,
        b = (998244353ll * b + s[i] * 233) % 1000000009;
    if (!T.count(make_pair(a, b)))
      ans += S[make_pair(a, b)], T.insert(make_pair(a, b));
    return;
  }
  if (s[no] == '?') {
    for (int i = 0; i < 5; i++) s[no] = 'a' + i, dfs(no + 1), s[no] = '?';
    tag[no] = 1;
    dfs(no + 1);
    tag[no] = 0;
  } else
    dfs(no + 1);
}
int main() {
  cin >> n >> m;
  while (n--) {
    scanf("%s", s + 1), x = strlen(s + 1), a = b = 0;
    for (int i = 1; i <= x; i++)
      a = (19260817ll * a + s[i] * 233) % 1000000007,
      b = (998244353ll * b + s[i] * 233) % 1000000009;
    S[make_pair(a, b)]++;
  }
  while (m--) {
    scanf("%s", s + 1), x = strlen(s + 1);
    ans = 0, T.clear(), dfs(1);
    printf("%d\n", ans);
  }
  return 0;
}
