#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define debug(a) cout<<a<<'\n'
#define Pll pair<ll,ll>
#define PII pair<int,int>
#define ft first
#define sd second
#define vec vector
#define pushk push_back
#define ump unordered_map
#define pl p<<1
#define pr p<<1|1
using namespace std;
const int N = 5e5 + 10, M = 1e6 + 10, mod = 1e9+7;
const ll inf = 1e18;
const ld eps = 1e-13;
int mov[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }, dx, dy, _ = 1, __ = 1;
void bout(bool f) {
	if (f)cout << "YES\n";
	else cout << "NO\n";
}
ll n,m,k;
int tr[M][26],num[M],idx;
ll re[30][30];
int pos[30]; 

void insert(string &s){
	int p=0,c;
	for(int i=0;i<s.length();++i){
		c=s[i]-'a';
		for(int j=0;j<26;++j){
			if(j==c)continue;
			else re[c][j]+=num[tr[p][j]];
		}
		if(!tr[p][c])tr[p][c]=++idx;
		p=tr[p][c];
		++num[p];
	}
}


void ini() {

}
void solve() {
	cin>>n>>k;
	string s;
	for(int i=1;i<=n;++i){
		cin>>s;
		insert(s);
	}
	int c,x,y;
	while(k--){
		cin>>s;
		for(int i=0;i<26;++i){
			c=s[i]-'a';
			pos[c]=i;	
		}
		ll ans=0;
		for(int i=0;i<26;++i){
			for(int j=0;j<26;++j){
				if(pos[i]<pos[j])ans+=re[i][j];
			}
		}
		cout<<ans<<'\n';
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifndef ONLINE_JUDGE
	streambuf *cinbp=cin.rdbuf(),*coutbp=cout.rdbuf();
	ifstream fin("in.txt");
	ofstream fout("out.txt");	
	cin.rdbuf(fin.rdbuf());
	cout.rdbuf(fout.rdbuf());
#endif
	//cin >> _;
	__ = _;
	ini();
	while (_--) {
		solve();
	}
	return 0;
}