INDEX

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<22)
char s[MX];
int t[26][MX],L,E[MX],N,Q,O,o;
void adw(char*c,int l,int d){
    ++E[d];
    if(!c[l])return;
    if(t[c[l]-97][d])adw(c,l+1,t[c[l]-97][d]);
    else adw(c,l+1,t[c[l]-97][d]=++L);
}
int fx(char*c,int l,int d){
    if(!c[l])return E[d];
    if(!t[c[l]-97][d])return 0;
    return fx(c,l+1,t[c[l]-97][d]);
}
int main(void){
    scanf("%d%d",&N,&Q);
    F(N)scanf("%s",s),adw(s,0,0),O+=strlen(s);
    assert(O<ll(1e6));
    F(Q)scanf("%s",s),printf("%d\n",fx(s,0,0)),o+=strlen(s);
    assert(o<ll(1e6));
    return 0;
}