class TrieNode:
  __slots__ = ("sum", "children")

  def __init__(self):
    self.sum = 0
    self.children = [None] * 26

  def merge(self, other):
    self.sum += other.sum
    for c in range(26):
      rhs = other.children[c]
      if rhs:
        lhs = self.children[c]
        if lhs:
          lhs.merge(rhs)
        else:
          self.children[c] = rhs

class Trie:
  __slots__ = ("root", "subst")

  def __init__(self, l):
    self.root = TrieNode()
    self.subst = [[[c] for c in range(26)] for _ in range(l)]
  
  def add(self, s):
    cur = self.root
    cur.sum += 1
    for k in range(len(s)):
      c = s[k]
      if not cur.children[c]:
        node = TrieNode()
        cur.children[c] = node
      cur = cur.children[c]
      cur.sum += 1
  
  def substitute(self, k, c, d):
      x, y = self.subst[k][d], self.subst[k][c]
      if len(x) < len(y): x, y = y, x
      for v in y: x.append(v)
      self.subst[k][d] = x
      self.subst[k][c] = []
  
  def search(self, s):
    cur = self.root
    for k in range(len(s)):
      d = s[k]
      last = None
      for c in self.subst[k][d]:
        node = cur.children[c]
        if node:
          if last:
            last.merge(node)
          else:
            last = node
      if not last:
        return 0
      cur = last
    return cur.sum
  
def convert(str):
    return [ord(str[i]) - 0x61 for i in range(len(str))]

N, L, Q = map(int, input().split())
trie = Trie(L)
for _ in range(N):
  trie.add(convert(input().strip()))

for _ in range(Q):
  query = input().strip().split()
  if query[0] == "1":
    k = int(query[1]) - 1
    c = ord(query[2]) - 0x61
    d = ord(query[3]) - 0x61
    trie.substitute(k, c, d)
  else:
    t = convert(query[1])
    print(trie.search(t))