#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<int, int> pii;
#define LF(x) fixed << setprecision(x)
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 2e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;

int son[N][30];
int cnt[N];
int idx;
int f[30][30];
int sum;

void insert(string s)
{
    int p=0;
    for(int i=0;i<s.size();i++)
    {
        int u=s[i]-'a';
        for(int j=0;j<26;j++)
        {
            if(son[p][j]&&u!=j)
            {
                f[u][j]+=cnt[son[p][j]];
            }
        }
        if(!son[p][u])
            son[p][u]=++idx;
        p=son[p][u];
        if(i==s.size()-1)
            sum+=cnt[p];
        cnt[p]++;
    }
}

void solve()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        string s;
        cin>>s;
        insert(s);
    }
//    cout<<sum<<endl;
    for(int i=0;i<26;i++)
    {
        for(int j=0;j<26;j++)
        {
            char u=char(i+'a');
            char v=char(j+'a');
//            cout<<u<<" "<<v<<": "<<f[i][j]<<endl;
        }
    }
    while(m--)
    {
        string s;
        cin>>s;
        int ans=0;
        for(int i=0;i<s.size();i++)
        {
            int q=s[i]-'a';
            for(int j=i+1;j<s.size();j++)
            {
                int h=s[j]-'a';
                ans+=f[q][h];
            }
        }
        cout<<ans+sum<<endl;
    }
}
signed main()
{
    ios;
    int T;
    T = 1;
    // cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}