/* -*- coding: utf-8 -*-
 *
 * 2761.cc:  No.2761 Substitute and Search - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 1000;
const int MAX_L = 3000;

/* typedef */

using vi = vector<int>;

struct Node {
  int cs[26], s;
  Node(): s(0) {}
};

/* global variables */

Node buf[MAX_N * MAX_L];
int bpt = 0;
char s[MAX_L + 4];
int ts[MAX_L][26];

/* subroutines */

int alloc_node() {
  int u = bpt++;
  fill(buf[u].cs, buf[u].cs + 26, -1);
  buf[u].s = 0;
  return u;
}

void trie_add(int l, char s[]) {
  int u = 0;
  for (int i = 0; i < l; i++) {
    int ci = s[i] - 'a';
    if (buf[u].cs[ci] < 0) buf[u].cs[ci] = alloc_node();
    u = buf[u].cs[ci];
    buf[u].s++;
  }
}

int trie_count(char s[]) {
  vi us(1, 0);
  for (int i = 0; s[i] >= ' '; i++) {
    int ci = s[i] - 'a';
    vi vs;
    for (auto u: us)
      for (int j = 0; j < 26; j++)
	if (ts[i][j] == ci && buf[u].cs[j] >= 0)
	  vs.push_back(buf[u].cs[j]);
    swap(us, vs);
  }

  int sum = 0;
  for (auto u: us) sum += buf[u].s;
  return sum;
}

/* main */

int main() {
  alloc_node();
  
  int n, l, qn;
  scanf("%d%d%d", &n, &l, &qn);

  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    trie_add(l, s);
  }
  
  for (int i = 0; i < l; i++)
    for (int j = 0; j < 26; j++) ts[i][j] = j;

  while (qn--) {
    int op;
    scanf("%d", &op);

    if (op == 1) {
      int k;
      char sc[4], sd[4];
      scanf("%d%s%s", &k, sc, sd);
      k--;
      int c = sc[0] - 'a', d = sd[0] - 'a';

      for (int j = 0; j < 26; j++)
	if (ts[k][j] == c) ts[k][j] = d;
    }
    else {
      scanf("%s", s);
      
      int cnt = trie_count(s);
      printf("%d\n", cnt);
    }
  }
  
  return 0;
}