#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define ld long double
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define yes cout << "YES" << '\n';
#define no cout << "NO" << '\n';
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
#define endl '\n'
#define PI acos(-1)
#define Ones(n) __builtin_popcount(n)
#define Onesl(n) __builtin_popcountll(n)
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
//const ll N = 2e5 + 5;
const int OO = 0x3f3f3f3f;
const ll LOO = 0x3f3f3f3f3f3f3f3f;
int dx8[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy8[] = {-1, +1, +0, +0, +1, -1, +1, -1};
int dx4[] = {+0, +0, -1, +1};
int dy4[] = {-1, +1, +0, +0};

void Rokba() {
    cin.tie(nullptr), cout.tie(nullptr), cin.sync_with_stdio(false), cout.sync_with_stdio(false);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}


const int N = 1e6 + 5, P1 = 31, P2 = 37, M = 1e9 + 7;
int pw1[N], pw2[N], inv1[N], inv2[N];

int mul(int a, int b){
    a = ((a % M) + M) % M;
    b = ((b % M) + M) % M;
    return (a * 1LL * b) % M;
}

int add(int a, int b){
    a = ((a % M) + M) % M;
    b = ((b % M) + M) % M;
    return (a + b)%M;
}

int fastPower(int base, int power){
    if(!power)return 1;
    int ret = fastPower(base, power >> 1);
    ret = mul(ret, ret);
    if(power % 2) ret = mul(ret, base);
    return ret;
}

void pre(){
    pw1[0] = inv1[0] = pw2[0] = inv2[0] = 1;
    int mulInv1 = fastPower(P1, M - 2);
    int mulInv2 = fastPower(P2, M - 2);
    for (int i = 1; i < N; ++i) {
        pw1[i] = mul(pw1[i - 1], P1);
        pw2[i] = mul(pw2[i - 1], P2);
        inv1[i] = mul(inv1[i - 1], mulInv1);
        inv2[i] = mul(inv2[i - 1], mulInv2);
    }
}

struct Hash{
    vector<pair<int, int>> prefixHash;

    Hash(){

    }

    Hash(string s){
        prefixHash = vector<pair<int, int>>(s.size(), {0, 0});
        for (int i = 0; i < s.size(); ++i) {
            prefixHash[i].first = mul(s[i] - 'a' + 1, pw1[i]);
            prefixHash[i].second = mul(s[i] - 'a' + 1, pw2[i]);
            if(i){
                prefixHash[i] = {
                        add(prefixHash[i].first, prefixHash[i - 1].first),
                        add(prefixHash[i].second, prefixHash[i - 1].second)
                };
            }
        }
    }

    pair<int, int> getHashVal(){
        return prefixHash.back();
    }

    pair<int, int> getRangeHashVal(int l, int r){
        return {
                mul(add(prefixHash[r].first, -(l ? prefixHash[l - 1].first : 0)), inv1[l]),
                mul(add(prefixHash[r].second, -(l ? prefixHash[l - 1].second : 0)), inv2[l])
        };
    }
};

typedef pair<int, int> pi;

void Solution() {
    int n, q;
    cin >> n >> q;
    vector<string> v(n);
    map<pi, int> pref, suf;
    map<pair<pi, pi>, int> both;
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        Hash h(v[i]);
        for (int j = 0, k = (int)v[i].size() - 1; j < v[i].size(); ++j, k--) {
            pref[h.getRangeHashVal(0, j)]++;
            suf[h.getRangeHashVal(k, (int)v[i].size() - 1)]++;
            both[{h.getRangeHashVal(0, j), h.getRangeHashVal(k, (int)v[i].size() - 1)}]++;
        }
    }
    while (q--){
        string type, a, b;
        cin >> type >> a >> b;
        Hash pr(a), sf(b);
        int ans = 0;
        if(type == "AND"){
            if(both.count({pr.getHashVal(), sf.getHashVal()})){
                ans += both[{pr.getHashVal(), sf.getHashVal()}];
            }
        }
        else if(type == "OR"){
            if(pref.count(pr.getHashVal())){
                ans += pref[pr.getHashVal()];
            }
            if(suf.count(sf.getHashVal())){
                ans += suf[sf.getHashVal()];
            }
            if(both.count({pr.getHashVal(), sf.getHashVal()})){
                ans -= both[{pr.getHashVal(), sf.getHashVal()}];
            }
        }
        else{
            if(pref.count(pr.getHashVal())){
                ans += pref[pr.getHashVal()];
            }
            if(suf.count(sf.getHashVal())){
                ans += suf[sf.getHashVal()];
            }
            if(both.count({pr.getHashVal(), sf.getHashVal()})){
                ans -= 2 * both[{pr.getHashVal(), sf.getHashVal()}];
            }
        }
        cout << ans << '\n';
    }
}

int main() {
    Rokba();
    pre();
    int T = 1;
//    cin >> T;
    while (T--) {
        Solution();
    }
}