#include<bits/stdc++.h>
#define int long long

using namespace std;
typedef pair<char, char> pii;
const int N = 1e6 + 10;

int n, q;
map<pii, int> mp;
int son[N][26], cnt[N], idx;
int all;

void insert(string& s) {
    int p = 0;

    for (auto& it : s) {
        int u = it - 'a';
        for (int i = 0; i <= 25; i++) {
            if (i == u) continue;
            if (son[p][i]) {
                char ch = i + 'a';
                mp[{ch, it}] += cnt[son[p][i]];
            }
        }
        if (!son[p][u]) son[p][u] = ++idx;
        cnt[son[p][u]]++;
        p = son[p][u];
    }
    for (int i = 0; i <= 25; i++)
        if (son[p][i]) all += cnt[son[p][i]];
}

void solve() {
    cin >> n >> q;

    while (n--) {
        string s;
        cin >> s;
        insert(s);
    }

    for (int i = 1; i <= q; i++) {
        string s;
        cin >> s;
        
        int nums = 0;
        for (int i = 1; i <= 25; i++)
            for (int j = 0; j < i; j++)
                nums += mp[{s[i], s[j]}];

        cout << nums + all << endl;
    }

}
signed main() {
    int _ = 1;
    //cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}