#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(2)
//#pragma GCC optimize(3, "Ofast", "inline")
#define hh putchar('\n')
#define kg putchar(' ')
#define debug puts("debug")
//#define int long long
//#define int __int128
namespace quickread{
	template<typename T> void read(T &x){
		x=0;char c=getchar();T neg=0;
		while(!isdigit(c)) neg|=!(c^'-'),c=getchar();
		while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
		if(neg) x=(~x)+1;
	}
	template<typename T> void write(T x){
		if(x<0) putchar('-'),x=~x+1;
		if(x>9) write(x/10);
		putchar(x%10^48);
	}
	inline string readstr(){
    	char ch=getchar();string str="";
		while(!isalnum(ch)) ch=getchar();
		while(isalnum(ch)){str+=ch;ch=getchar();}
		return str;
	}
	inline char readchar(){
		char ch=getchar();
		while(!isalnum(ch)) ch=getchar();
		return ch;
	}
}
using namespace quickread;
const int N=2e6+10;
int n,m,tree[N][30],tag[N],lst[N],dep[N],val[N],tot=1;
void update(string s){
	int len=s.length(),p=1;
	for(int i=0;i<len;++i){
		int ch=s[i]-'a'+1;
		if(!tree[p][ch]) tree[p][ch]=++tot,dep[tot]=dep[p]+1;
		p=tree[p][ch];
	}
	tag[p]=1;
}
void init(){
	queue<int>q;
	for(int i=1;i<=26;++i) if(tree[1][i]) q.push(tree[1][i]);
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int i=1,v;i<=26;++i){
			v=tree[u][i];
			if(v) lst[v]=tree[lst[u]][i],q.push(v);
			else tree[u][i]=tree[lst[u]][i];
		}
	} 
}
int query(string s){
	int len=s.length(),p=1;
	memset(val,0,sizeof(val));
	val[0]=1;
	for(int i=0;i<len;++i){
		int ch=s[i]-'a'+1;
		p=tree[p][ch];
		for(int j=p;j;j=lst[j]) if(tag[j]&&val[i+1-dep[j]]){val[i+1]=1;break;}
	}
	for(int i=len;i>=1;--i) if(val[i]) return i;
	return 0;
}
string s;
signed main(){
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	read(n),read(m);
	for(int i=1;i<=n;++i) s=readstr(),update(s);
	init();
	for(int i=1;i<=m;++i) s=readstr(),write(query(s)),hh;
	return 0;
}

record 思路来源于此题解