#include <bits/stdc++.h>
using namespace std;

struct TrieNode {
    int count;
    unordered_map<char, TrieNode*> children;
    TrieNode() : count(0) {}
};

void insert(TrieNode* root, const string& word) {
    TrieNode* current = root;
    for (char c : word) {
        if (current->children.find(c) == current->children.end()) {
            current->children[c] = new TrieNode();
        }
        current->children[c]->count += 1;
        current = current->children[c];
    }
}

int main() {
    int n, l, q;
    cin >> n >> l >> q;
    vector<string> s(n);
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }

    TrieNode* tree = new TrieNode();
    for (const string& t : s) {
        insert(tree, t);
    }

    vector<vector<char>> char_cur(l, vector<char>(26));
    for (int i = 0; i < l; ++i) {
        for (int j = 0; j < 26; ++j) {
            char_cur[i][j] = 'a' + j;
        }
    }

    for (int i = 0; i < q; ++i) {
        int com;
        cin >> com;
        if (com == 1) {
            int k;
            char c, d;
            cin >> k >> c >> d;
            --k;
            replace(char_cur[k].begin(), char_cur[k].end(), c, d);
        } else {
            string t;
            cin >> t;
            vector<TrieNode*> cur = {tree};
            int ans = 0;
            for (int i = 0; i < t.size(); ++i) {
                vector<TrieNode*> cur_next;
                ans = 0;
                for (TrieNode* tr : cur) {
                    for (auto& [key, value] : tr->children) {
                        if (char_cur[i][key - 'a'] == t[i]) {
                            cur_next.push_back(value);
                            ans += value->count;
                        }
                    }
                }
                cur = cur_next;
            }
            cout << ans << endl;
        }
    }

    // Clean up dynamically allocated TrieNodes
    function<void(TrieNode*)> deleteTrie = [&](TrieNode* node) {
        for (auto& [key, child] : node->children) {
            deleteTrie(child);
        }
        delete node;
    };
    deleteTrie(tree);

    return 0;
}