#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
const int N = 2e5+5;
int n,m,last=1,tot=1,tr[N][26],fa[N],len[N],cnt[N],vis[N];
string s[N],ss;
void extend(int c)
{
    int v=last,u=++tot;last=u;
    len[u]=len[v]+1;
    while (v&&!tr[v][c]) tr[v][c]=u,v=fa[v];
    if (!v) fa[u]=1;
    else{
        int x=tr[v][c];
        if (len[x]==len[v]+1) fa[u]=x;
        else{
            int y=++tot;
            memcpy(tr[y],tr[x],sizeof(tr[y]));
            fa[y]=fa[x];fa[x]=fa[u]=y;len[y]=len[v]+1;
            while (v&&tr[v][c]==x) tr[v][c]=y,v=fa[v];
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1,l;i<=n;++i)
    {
        cin>>s[i];l=s[i].length();
        last=1;
        for (int j=0;j<l;++j) extend(s[i][j]-'a');
    }
    for (int i=1;i<=n;++i)
        for (int j=0,l=s[i].length(),now=1;j<l;++j)
        {
            now=tr[now][s[i][j]-'a'];
            int t=now;
            while (t&&vis[t]!=i) cnt[t]++,vis[t]=i,t=fa[t];
        }
    while (m--)
    {
        cin>>ss;int l=ss.length(),now=1;
        for (int i=0;i<l;++i)
            now=tr[now][ss[i]-'a'];
        printf("%d\n",cnt[now]);
    }
    return 0;
}