#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
using namespace std;

const long long MAXM = 1e6 + 10;
const long long MAXN = 5e5 + 10;
long long n, q, eid;
long long Trie[MAXN][30], Size[MAXN][30];
long long Fen[30][30];

string str[MAXN], str2[MAXN];

int main() {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> str[i];
		int len = str[i].length();
		long long p = 0;
		for (int j = 0; j < len; j++) {
			long long ch = str[i][j] - 'a';
			for (long long u = 0; u < ch; u++) {
				if (Trie[p][u]) {
					Fen[u][ch] += Size[p][u];
				}
			}
			for (long long u = ch + 1; u < 25; u++) {
				if (Trie[p][u]) {
					Fen[u][ch] += Size[p][u];
				}
			}
			if (!Trie[p][ch]) {
				Trie[p][ch] = ++eid;
				Size[p][ch] = 1;
				p = eid;
			} else {
				Size[p][ch] += 1;
				p = Trie[p][ch];
			}
		}
	}
//	for (int i = 0; i < 25; i++) {
//		for (int j = 0; j < 25; j++)
//			cout << Fen[i][j] << " ";
//		cout << endl;
//	}
	for (int i = 1; i <= q; i++) {
		cin >> str2[i];
		long long cnt = 0;
		for (int j = 0; j < 25; j++) {
			for (int k = j + 1; k < 25; k++) {
				int ch1 = str2[i][j] - 'a', ch2 = str2[i][k] - 'a';
				cnt += Fen[ch2][ch1];
			}
		}
		printf("%lld\n", cnt);
	}
	return 0;
}