//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
mt19937_64 rnd(20210448);
const ll mod=998244353,base=rnd()%400+1000;
map<ll,int> M1,M2;
map<pair<ll,ll>,int> M3;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,q;
	cin>>n>>q;
	for(int i=1;i<=n;i++)
	{
		string s;
		cin>>s;
		ll H1=0,H2=0;
		for(int j=0;j<sz(s);j++)
		{
			H1=(H1*base+s[j])%mod;
			H2=(H2*base+s[sz(s)-j-1])%mod;
			M1[H1]++;
			M2[H2]++;
			M3[mp(H1,H2)]++;
		}
	}
	while(q--)
	{
		string s;
		cin>>s;
		string A,B;
		cin>>A>>B;
		ll H1=0,H2=0;
		for(auto ch:A)
			H1=(H1*base+ch)%mod;
		rev(B);
		for(auto ch:B)
			H2=(H2*base+ch)%mod;
		if(s=="AND")
			cout<<M3[mp(H1,H2)]<<endl;
		else if(s=="OR")
			cout<<M1[H1]+M2[H2]-M3[mp(H1,H2)]<<endl;
		else
			cout<<M1[H1]+M2[H2]-M3[mp(H1,H2)]*2<<endl;
	}
	return 0;
}