class segtree:
  def __init__(self,n,k):
    self.size=1
    self.m=k
    while self.size<n:
      self.size*=2
    self.dat=[0]*(self.size*2)
  def update(self,x,a):
    x+=self.size
    self.dat[x]=a
    while x>1:
      x//=2
      self.dat[x]=(self.dat[2*x]+self.dat[2*x+1])%self.m
  def querry(self,u,v):
    u+=self.size
    v+=self.size
    score=0
    while u<v:
      if u&1:
        score+=self.dat[u]
        u+=1
      if v&1:
        v-=1
        score+=self.dat[v]
      u//=2
      v//=2
    return score%self.m
mod=67280421310721
N,L,Q=map(int,input().split())
u=[1]*(L+1)
for i in range(1,L+1):
  u[i]=u[i-1]*100
  u[i]%=mod
Z=[segtree(L,mod) for i in range(N)]
v=[[0]*L for i in range(N)]
for i in range(N):
  s=input()
  for j in range(L):
    x=ord(s[j])-ord('a')+1
    w=x*u[j]%mod
    Z[i].update(j,w)
    v[i][j]=x
for _ in range(Q):
  t,*A=map(str,input().split())
  t=int(t)
  if t==1:
    k,c,d=A[:]
    k=int(k)-1
    x=ord(c)-ord('a')+1
    y=ord(d)-ord('a')+1
    for i in range(N):
      if v[i][k]==x:
        v[i][k]=y
        w=y*u[k]%mod
        Z[i].update(k,w)
  else:
    s=A[0]
    e=0
    for i in range(len(s)):
      x=ord(s[i])-ord('a')+1
      e+=x*u[i]%mod
      e%=mod
    result=0
    for i in range(N):
      b=Z[i].querry(0,len(s))
      b%=mod
      if b==e:
        result+=1
    print(result)