#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;

int N,L,Q;
vector<string> S;
vector<int> OP;
vector<string> T;
vector<int> K;
vector<char> C,D;

void solve(){
    using P = pair<string,int>;
    vector<P> v;
    for(int i = 0;i<N;i++){
        v.push_back({S[i],-1});
    }
    for(int i= 0;i<Q;i++){
        if(OP[i] == 1){
        }else{
            string l = T[i];
            string r = T[i];
            while(l.size()< L){
                l.push_back('a'-1);
            }
            while(r.size()< L){
                r.push_back('z'+1);
            }
            v.push_back({l,i});
            v.push_back({r,i});
        }
    }
    sort(v.begin(),v.end());
    for(int i = 0;i<Q;i++){
        if(OP[i] == 1){
            for(int j = 0;j<v.size();j++){
                if(v[j].second == -1){
                    if(v[j].first[K[i]-1] == C[i]){
                        v[j].first[K[i]-1] = D[i];
                    }
                }
            }
            sort(v.begin(),v.end());
        }else{
            bool flg = false;
            int cnt  = 0;
            for(int j = 0;j<v.size();j++){
                if(v[j].second == i){
                    flg = !flg;
                }
                if(flg && v[j].second == -1){
                    cnt++;
                }
            }
            cout<<cnt<<endl;
        }
    }
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> N >> L >> Q;
	S.resize(N);
	OP.resize(Q);
	T.resize(Q);
	K.resize(Q);
	C.resize(Q);
	D.resize(Q);
	for(int i = 0;i<N;i++){
		cin >> S[i];
	}
	for(int i = 0;i<Q;i++){
		cin >> OP[i];
		if(OP[i] == 2){
			cin >> T[i];
		}else{
			cin >> K[i] >> C[i] >> D[i];
		}
	}
	solve();
}