n,l,q=map(int,input().split())

def update(st,p,x,M):
  p+=1
  while p<=len(st):
    st[p-1]+=x
    st[p-1]%=M
    p+=p&(-p)
  return

def getsum(st,p,M):
  p+=1
  a=0
  while p>0:
    a+=st[p-1]
    a%=M
    p-=p&(-p)
  return a

B1=1007
M1=1000000007

P1=[1]
for i in range(1,3001):
  P1+=[P1[-1]*B1%M1]
R1=[1,pow(B1,M1-2,M1)]
for i in range(2,3001):
  R1+=[R1[-1]*R1[1]%M1]

S=[]
s1=[]
for i in range(n):
  s=input()
  S+=[list(s)]
  s1+=[[0]*l]
  for j in range(l):
    update(s1[i],j,ord(s[j])*P1[j]%M1,M1)

for _ in range(q):
  query=input().split()
  if int(query[0])==1:
    _,k,c,d=query
    k=int(k)-1
    c=ord(c)
    d=ord(d)
    for i in range(n):
      if ord(S[i][k])==c:
        update(s1[i],k,(-c+d)*P1[k]%M1,M1)
        S[i][k]=chr(d)
  else:
    _,t=query
    t=list(t)
    h1=0
    for i in range(len(t)):
      h1+=ord(t[i])*P1[i]
      h1%=M1
    g=0
    r=10
    for i in range(n):
      if len(t)<=r:
        g+=t==S[i][:len(t)]
        continue
      else:
        if t[:r]!=S[i][:r]:
          continue
      if getsum(s1[i],len(t)-1,M1)==h1:
        g+=1
    print(g)