#include <bits/stdc++.h>
using namespace std;
string i_s(int x) {
  if (x == 0) return "0";
  string ret = "";
  while (x) {
    ret = ret + (char)(x % 10 + '0');
    x /= 10;
  }
  reverse(ret.begin(), ret.end());
  return ret;
}
string add(string a, string b) {
  if (a == "") a = "0";
  if (b == "") b = "0";
  if (a.length() < b.length()) swap(a, b);
  while (b.length() < a.length()) {
    b = '0' + b;
  }
  for (int i = 0; i < a.length(); i++) {
    a[i] = a[i] + (b[i] - '0');
  }
  bool big = false;
  for (int i = a.length() - 1; i >= 0; i--) {
    if (big) {
      a[i]++;
    }
    big = false;
    if (a[i] > '9') {
      a[i] = a[i] - 10;
      big = true;
    }
  }
  if (big) a = '1' + a;
  return a;
}
string mul(string a, string b) {
  vector<int> va, vb;
  if (a == "0" || b == "0") return "0";
  string ans;
  for (int i = 0; i < a.length(); i++) {
    va.push_back(a[i] - '0');
  }
  for (int i = 0; i < b.length(); i++) {
    vb.push_back(b[i] - '0');
  }
  reverse(va.begin(), va.end());
  reverse(vb.begin(), vb.end());
  vector<int> res;
  res.clear();
  res.resize(1005);
  for (int i = 0; i < a.length(); i++) {
    for (int j = 0; j < b.length(); j++) {
      res[i + j] += (va[i] * vb[j]);
    }
  }
  for (int i = 0; i < 1005; i++) {
    if (res[i] > 9) {
      res[i + 1] += (res[i] / 10);
      res[i] %= 10;
    }
  }
  for (int i = 0; i < 1005; i++) {
    ans += (res[i] + '0');
  }
  reverse(ans.begin(), ans.end());
  int k = 0;
  while (ans[k] == '0') {
    k++;
  }
  ans = ans.substr(k);
  return ans;
}
bool is_prime(int n) {
  if (n < 2) return false;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
char s[55];
int son[5000005][7];
int num[5000005], cnt, vis[5000005];
void Insert(int len) {
  int x = 1;
  for (int i = 1; i <= len; i++) {
    int nxt = s[i] - 'a' + 1;
    if (!son[x][nxt]) son[x][nxt] = ++cnt;
    x = son[x][nxt];
  }
  num[x]++;
}
int y, cur;
int query(int x, int k) {
  if (!k) return 0;
  if (x == y + 1) {
    if (vis[k] != cur) {
      vis[k] = cur;
      return num[k];
    } else
      return 0;
  }
  if (s[x] != '?')
    return query(x + 1, son[k][s[x] - 'a' + 1]);
  else {
    int sz = 0;
    for (int i = 1; i <= 5; i++) sz += query(x + 1, son[k][i]);
    sz += query(x + 1, k);
    return sz;
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  cnt = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%s", s + 1);
    int len = strlen(s + 1);
    Insert(len);
  }
  for (int i = 1; i <= m; i++) {
    cur = i;
    scanf("%s", s + 1);
    y = strlen(s + 1);
    printf("%d\n", query(1, 1));
  }
  return 0;
}
