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
B2=1009
M2=1000000009

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

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

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 (getsum(s1[i],k,M1)-getsum(s1[i],k-1,M1))*R1[k]%M1==c and (getsum(s2[i],k,M2)-getsum(s2[i],k-1,M2))*R2[k]%M2==c:
        update(s1[i],k,(-c+d)*P1[k]%M1,M1)
        update(s2[i],k,(-c+d)*P2[k]%M2,M2)
  else:
    _,t=query
    h1=0
    h2=0
    for i in range(len(t)):
      h1+=ord(t[i])*P1[i]
      h1%=M1
      h2+=ord(t[i])*P2[i]
      h2%=M2
    g=0
    for i in range(n):
      if getsum(s1[i],len(t)-1,M1)==h1 and getsum(s2[i],len(t)-1,M2)==h2:
        g+=1
    print(g)