#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
void debug() {std::cerr << "\n";}
template<class T, class... OtherArgs>
void debug(T &&var, OtherArgs &&... args) {
    std::cerr << std::forward<T>(var) << " ";
    debug(std::forward<OtherArgs>(args)...);
}
#define SZ(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using i64 = long long;
using u64 = unsigned long long;
using LD = long double;
using PII = pair<int, int>;
constexpr int N = 1000010;
constexpr int P = 998244353;

int son[N][26], cnt[N], idx, ans[N];
vector<int> cmp[26][26];
int extra;

void insert(string &s) {
    int p = 0;
    for (int i = 0; i < s.size(); i++) {
        int u = s[i] - 'a';
        for (int v = 0; v < 26; v++) {
            if (!son[p][v]) {
                continue;
            }
            for (int id : cmp[u][v]) {
                ans[id] += cnt[son[p][v]];
            }
        }
        if (!son[p][u]) {
            son[p][u] = ++idx;
        }
        p = son[p][u];
        cnt[p]++;
    }
    for (int v = 0; v < 26; v++) {
        if (!son[p][v]) {
            continue;
        }
        extra += cnt[son[p][v]];
    }
}

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

    for (int i = 0; i < q; i++) {
        string s;
        cin >> s;
        for (int x = 0; x < 26; x++) {
            for (int y = x + 1; y < 26; y++) {
                cmp[s[x] - 'a'][s[y] - 'a'].pb(i);
            }
        }
    }

    for (int i = 0; i < n; i++) {
        insert(str[i]);
    }

    for (int i = 0; i < q; i++) {
        cout << ans[i] + extra << '\n';
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    int _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
}