#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 5e5 + 10, M = 26, MOD = 80112002;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m;
LL idx;
LL son[N][M], cnt2[N * M], cnt[N * M];
LL f[M][M];

void add(string s)
{
    int cur = 0;
    int len = s.length();
    for(int i = 0; i < len; i ++)
    {
        if(!son[cur][s[i] - 'a']) son[cur][s[i] - 'a'] = ++ idx;
        for(int j = 0; j < 26; j ++) 
        {
            if(son[cur][j] && j != s[i] - 'a') 
                f[j][s[i] - 'a'] += cnt[son[cur][j]];
        }
        f[s[i] - 'a'][s[i] - 'a'] += cnt2[cur];
        cur = son[cur][s[i] - 'a'];
        cnt[cur] ++;
    }
    cnt2[cur] ++;
}

void solve() 
{
    cin >> n >> m;
    vector<string> vec(n);
    for(int i = 0; i < n; i ++)
    {
        cin >> vec[i];
    }

    for(auto t : vec) add(t);

    while(m -- )
    {
        LL ans = 0;
        string s;
        cin >> s;
        for(int i = 0; i < 26; i ++)
            for(int j = 0; j <= i; j ++)
            {
                ans += f[s[i] - 'a'][s[j] - 'a'];
            }
        cout << ans << endl;
    }
}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T = 1;
    // cin >> T;
    while(T --)
    {
        solve();
    }
}