#include <bits/stdc++.h>

using i64 = long long;

const int N = 5e5;
std::vector<std::array<int, 26>> tr(N);
std::vector<std::array<int, 26>> cnt(N);
std::vector<int> end(N);
int cur = 0;
i64 sum = 0;
std::array<std::array<i64, 26>, 26> d{};

void insert(std::string &s) {
    int u = 0;
    for(auto c : s) {
        if(not tr[u][c - 'a']) tr[u][c - 'a'] = ++cur;
        cnt[u][c - 'a'] += 1;
        u = tr[u][c - 'a'];
    }
    end[u] += 1;
}

void query(std::string &s) {
    int u = 0;
    for(auto c : s) {
        for(int j = 0; j < 26; j ++ ) {
            if(j == c - 'a') continue;
            d[c - 'a'][j] += cnt[u][j];
        }
        if(not tr[u][c - 'a']) return;
        u = tr[u][c - 'a'];
        sum += end[u];
    }
}

int main() {
    int n, q;
    std::cin >> n >> q;

    std::vector<std::string> s(n);
    for(int i = 0; i < n; i ++ ) {
        std::cin >> s[i];
    }

    for(int i = n - 1; i >= 0; i -- ) {
        query(s[i]);
        insert(s[i]);
    }
    
    while(q -- ) {
        std::string s;
        std::cin >> s;

        i64 ans = 0;
        std::vector<bool> r(26, 1);
        for(int i = 25; i >= 0; i -- ) {
            r[s[i] - 'a'] = false;
            for(int j = 0; j < 26; j ++ ) {
                if(r[j]) ans += d[s[i] - 'a'][j];
            }
        }
        std::cout << ans + sum << '\n';
    }

    return 0;
}