#include<iostream>
#include<cstring>
#include<stdlib.h>
#include<unordered_map>
#include<vector>
#include<array>
#include<math.h>
#include<map>
#include<stdio.h>
#include<queue>
#include<assert.h>
#include<string>
#include<limits.h>
#include<stack>
#include<set>
#include<list>
#include<algorithm>
#include <chrono>
#include<random>
using namespace std;

typedef long long LL;
//#define int long long
typedef unsigned long long ULL;
typedef pair<LL, LL>PII;
typedef pair<double, double>PDD;
typedef pair<char, char>PCC;
LL n, m, k;

const LL inf = 1e18;
const LL N = 5e5 + 10;
const LL mod = 1e9 + 7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int x, int y) {
    return uniform_int_distribution<int>(x, y)(rng);
}

struct HashSeq {
    vector<long long> P, H;
    int MOD, BASE;

    HashSeq() {}

    HashSeq(string& s, int MOD, int BASE) : MOD(MOD), BASE(BASE) {
        int n = s.size();
        P.resize(n + 1);
        P[0] = 1;
        for (int i = 1; i <= n; i++) P[i] = P[i - 1] * BASE % MOD;
        H.resize(n + 1);
        H[0] = 0;
        for (int i = 1; i <= n; i++) H[i] = (H[i - 1] * BASE + (s[i - 1] ^ 7)) % MOD;
    }

    long long query(int l, int r) {
        return (H[r] - H[l - 1] * P[r - l + 1] % MOD + MOD) % MOD;
    }
};

int MOD1 = 998244353 + rnd(0, 1e9), BASE1 = 233 + rnd(0, 1e3);
int MOD2 = 998244353 + rnd(0, 1e9), BASE2 = 233 + rnd(0, 1e3);

struct HashString {
    HashSeq hs1, hs2;

    HashString(string& s) : hs1(HashSeq(s, MOD1, BASE1)), hs2(HashSeq(s, MOD2, BASE2)) {}

    long long query(int l, int r) {
        return hs1.query(l, r) * MOD1 + hs2.query(l, r);
    }
};
LL sum[26][26];
void solve() {
    int q;cin >> n >> q;
    map<LL, int>mp;
    LL ans = 0;
    map<LL, vector<char>>rec;
    for (int i = 1;i <= n;i++) {
        string s;cin >> s;
        HashString h(s);
        int m = s.size();
        s = " " + s;
        LL all = h.query(1, m);
        if (mp.count(all))ans += mp[all];
        rec[-1].push_back(s[1]);
        for (int j = 1;j < m;j++) {
            LL res = h.query(1, j);
            mp[res] += 1;
            rec[res].push_back(s[j + 1]);
        }
    }
    for (auto [x, y] : rec) {
        vector<int>cnt(26);
        for (auto c : y) {
            int d = c - 'a';
            for (int i = 0;i < 26;i++) {
                sum[i][d] += cnt[i];
            }
            cnt[d]++;
        }
    }
    while (q--) {
        string s;cin >> s;
        vector<int>pos(26);
        for (int i = 0;i < 26;i++) {
            pos[s[i] - 'a'] = i;
        }
        LL res = ans;
        for (int i = 0;i < 26;i++) {
            for (int j = 0;j < 26;j++) {
                if (pos[i] < pos[j]) {
                    res += sum[j][i];
                }
            }
        }
        cout << res << "\n";
    }
}
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}