#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename... Args>
void bubu(Args... args) { cout << ":: "; ((cout << args << " "), ...); cout << endl; }
void bubu(vector<int> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;

//=======================================================================
const int N = 1e6 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;
int mp[30][30];// qianmian dayu houmian
//=======================================================================


int val[N];
int F[N][30];
int cnt;
int fan(char x) {
    return x - 'a';
}
void add(string& s) {
    int now = 0;
    // val[0]++;

    for (auto x : s) {
        if (!F[now][fan(x)]) F[now][fan(x)] = ++cnt;

        rep(i, 0, 25) {
            if (i == fan(x)) continue;
            //mp[i][fan(x)] += 1;
            if (F[now][i]) mp[i][fan(x)] += val[F[now][i]];
        }

        now = F[now][fan(x)];
        val[now]++;

    }
}

signed main() {
    kuaidu();
    int q; cin >> n >> q;
    rep(i, 1, n) {
        string s; cin >> s;
        add(s);
    }

    // int tem = 0;
    // rep(i, 0, 25) rep(j, 0, 25) {
    //     if (mp[i][j]) cout << char(i + 'a') << " " << char(j + 'a') << " " << mp[i][j] << endl;
    // }
    // cout << tem << endl;

    rep(i, 1, q) {
        string s; cin >> s;
        int ans = 0;
        rep(j, 0, 25) rep(p, j + 1, 25) {
            ans += mp[fan(s[p])][fan(s[j])];
        }
        cout << ans << endl;
    }
    return 0;
}