#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int conv[3010][26];
int inv[3010][26];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, l, q;
  cin >> n >> l >> q;
  vector<string> s(n);
  rep(i, n) cin >> s[i];
  struct Node {
    int cnt;
    int to[26];
    Node() {
      cnt = 0;
      rep(i, 26) to[i] = -1;
    }
  };
  vector<Node> node(1);
  auto add = [&](const auto& s, int v) {
    int now = 0;
    rep(j, l) {
      if (node[now].to[s[j] - 'a'] == -1) {
        node[now].to[s[j] - 'a'] = node.size();
        node.emplace_back();
      }
      now = node[now].to[s[j] - 'a'];
      node[now].cnt += v;
    }
  };
  rep(i, n) add(s[i], 1);
  rep(j, l) rep(c, 26) conv[j][c] = inv[j][c] = c;
  rep(_, q) {
    int type;
    cin >> type;
    if (type == 1) {
      int k;
      char c, d;
      cin >> k >> c >> d;
      k--;
      int ci = c - 'a', di = d - 'a';
      if (inv[k][ci] == -1) continue;
      if (inv[k][di] == -1) {
        int x = inv[k][ci];
        inv[k][ci] = -1;
        inv[k][di] = x;
        conv[k][x] = di;
      } else {
        int x = inv[k][ci];
        int y = inv[k][di];
        rep(i, n) if (s[i][k] - 'a' == x) {
          add(s[i], -1);
          s[i][k] = 'a' + y;
          add(s[i], 1);
        }
        conv[k][x] = inv[k][ci] = -1;
      }
    } else {
      string t;
      cin >> t;
      int ans = [&]() {
        int now = 0;
        rep(j, ssize(t)) {
          int x = inv[j][t[j] - 'a'];
          if (x == -1 || node[now].to[x] == -1) return 0;
          now = node[now].to[x];
        }
        return node[now].cnt;
      }();
      cout << ans << '\n';
    }
  }
}