#include <bits/stdc++.h>

template<typename P, typename Q> std::istream& operator>>(std::istream& is, std::pair<P, Q>& v) { std::cin >> v.first >> v.second; return is; }
template<typename P, typename Q> std::ostream& operator<<(std::ostream& os, std::pair<P, Q>& v) { std::cout << v.first << ' ' << v.second; return os; }
template<typename T, std::size_t N> std::istream& operator>>(std::istream& is, std::array<T, N>& v) { for (auto& i : v) is >> i; return is; }
template<typename T, std::size_t N> std::ostream& operator<<(std::ostream& os, std::array<T, N>& v) { for (auto& i : v) os << i << ' '; return os; }
template<typename T> std::istream& operator>>(std::istream& is, std::vector<T>& v) { for (auto& i : v) is >> i; return is; }
template<typename T> std::ostream& operator<<(std::ostream& os, std::vector<T>& v) { for (auto& i : v) os << i << ' '; return os; }
template<typename...Args> void debug(Args...args) { ((std::cerr << args << ' '), ...); std::cerr << '\n'; }
template<typename...Args> void println(Args...args) { ((std::cout << args << ' '), ...); std::cout << '\n'; }
template<typename P, typename Q> void chmax(P& a, Q b) { a = (b > a ? b : a); }
template<typename P, typename Q> void chmin(P& a, Q b) { a = (b < a ? b : a); }

using i64 = long long;

constexpr int A = 26, N = 5E5;
namespace T {
    int idx;
    int tr[N][A], cnt[N * A], stop[N * A];
    i64 pre[A][A];
    i64 oth = 0;

    int newNode() {
        ++idx;
        std::memset(tr[idx], 0, sizeof tr[idx]);
        cnt[idx] = 0;
        return idx;
    }

    void init() {
        idx = 0;
        oth = 0;
        std::memset(pre, 0, sizeof pre);
        newNode();
    }

    void add(const std::string& s) {
        int p = 1;
        for (auto c : s) {
            int x = c - 'a';
            if (!tr[p][x]) {
                tr[p][x] = newNode();
            }
            for (int i = 0; i < A; i++) {
                if (tr[p][i] != 0) {
                    pre[x][i]++;
                }
            }
            p = tr[p][x];
            if (stop[p] != 0) {
                oth++;
            }
            cnt[p]++;
        }
        stop[p]++;
    }
};
using namespace T;

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int n, q;
    std::cin >> n >> q;

    T::init();

    for (int i = 0; i < n; i++) {
        std::string s;
        std::cin >> s;
        T::add(s);
    }

    while (q--) {
        std::string s;
        std::cin >> s;
        i64 ans = 0;
        for (int i = 0; i < s.size(); i++) {
            for (int j = i + 1; j < s.size(); j++) {
                ans += pre[s[i] - 'a'][s[j] - 'a'];
            }
        }
        std::cout << ans + oth << "\n";
    }

    return 0;
}