#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

random_device rd;
mt19937 mt(rd());

int random_prime(){
    while (true){
        int pr = mt() % 100000000 + 900000000;
        if (atcoder::internal::is_prime_constexpr(pr)){
            return pr;
        }
    }
}

using ull = unsigned long long;

using mint = modint998244353;

const int base = 334;
using S = mint;
S op(S a, S b){
	return a + b;
}
S e(){
	return S(0);
}

int main(){
	int n, l, q;
	cin >> n >> l >> q;
	vector<string> s(n);
	cin >> s;
	vector<segtree<S, op, e>> seg;
	vector<mint> coeff(l);
	coeff[0] = 1;
	rep(i, l - 1) coeff[i + 1] = coeff[i] * base;
	rep(i, n){
		vector<S> init(l);
		rep(j, l) init[j] = mint(s[i][j] - 'a') * coeff[j];
		segtree<S, op, e> seg_sub(init);
		seg.push_back(seg_sub);
	}
	rep(_, q){
		int t;
		cin >> t;
		if(t == 1){
			int k;
			char c, d;
			cin >> k >> c >> d;
			k--;
			rep(i, n){
				if(s[i][k] == c){
					seg[i].set(k, mint(d - 'a') * coeff[k]);
					s[i][k] = d;
				}
			}
		}
		if(t == 2){
			string t;
			cin >> t;
			int m = t.size();
			mint rh = 0;
			int ans = 0;
			rep(j, m) rh += (t[j] - 'a') * coeff[j];
			rep(i, n){
				auto val = seg[i].prod(0, m);
				if(val == rh) ans++;
			}
			cout << ans << "\n";
		}
	}
	return 0;
}