#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 = 1e6+ 10;
const LL mod = 1e9 + 7;

int P = 131;
int sum[26][26];
void solve() {
    int q;cin >> n >> q;
    unordered_map<int, int>mp;
    int ans = 0;
    map<int, vector<char>>rec;
    for (int i = 1;i <= n;i++) {
        string s;cin >> s;
        int m = s.size();
        s = " " + s;
        rec[-1].push_back(s[1]);
        int res = 0;
        for (int j = 1;j < m;j++) {
            res = ((res * P )%mod + s[j]) % mod;
            mp[res] += 1;
            rec[res].push_back(s[j + 1]);
        }
        res = ((res % mod * P % mod) % mod + s[m]) % mod;
        if (mp.count(res))ans += mp[res];
    }
    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;
        }
        int 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;
}