#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
constexpr int N = 1e6 + 10;
constexpr int inf = 1e9 + 10;
constexpr ll llinf = 1e18 + 10;
constexpr int mod = 1e9 + 7;
void debug() {
    std::cerr << "\n";
}
template<typename T, typename... Args>
void debug(T val, const Args&... args) {
    std::cerr << val << " ";
    debug(args...);
}
template<typename T>
void debug(const std::vector<T>& vec) {
    for (const T& x : vec) std::cerr << x << ' ';std::cerr << "\n";
}
struct trie
{
    int idx;
    std::vector<std::array<int, 26>> son;
    std::array<std::array<ll,26>, 26> cnt;
    std::vector<ll> w;
    std::array<int, 26> zeros;
    trie() {}
    trie(int _n) : idx(0), son(1), w(1) {
        for (int i = 0; i < 26; i++) {
            zeros[i] = 0;
            for (int j = 0; j < 26; j++) {
                cnt[i][j] = 0;
            }
        }
    }
    void insert(std::string s)
    {
        int p = 0;
        for (auto c : s) {
            int u = c - 'a';
            for (int i = 0; i < 26; i++) {
                if (i != u && son[p][i]) {
                    cnt[u][i] += w[son[p][i]];
                }
            }
            if(!son[p][u]) {
                p = son[p][u] = son.size();
                son.push_back(zeros);
                w.push_back(0);
            }
            else {
                p = son[p][u];
            }
            w[p]++;
        }
        for (int i = 0; i < 26; i++) {
            if (son[p][i]) {
                cnt[i][i] += w[son[p][i]];
            }
        }
    }
};
void ncl3() {
    int n, q;
    std::cin >> n >> q;
    std::vector<std::string> s(n);
    trie tr(N);
    for (int i = 0; i < n; i++) {
        std::cin >> s[i];
        tr.insert(s[i]);
    }
    for (int i = 0; i < q; i++) {
        std::string rule;
        std::cin >> rule;
        ll ans = 0;
        for (int i = 0; i < 26; i++) {
            for (int j = i; j < 26; j++) {
                ans += tr.cnt[rule[i] - 'a'][rule[j] - 'a'];
            }
            ans += tr.cnt[i][i];
        }
        std::cout << ans << "\n";
    }
}
/*
    预处理、找性质缩小范围、集合思想、正难则反、穷举
*/
int main() {
#ifdef LOCAL
    clock_t time = clock();
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ncl3();
    }
#ifdef LOCAL
    std::cout << "Time Used:" << clock() - time << "ms" << "\n";
#endif
    return 0;
}