#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

mint op(mint a, mint b) { return a + b; }
mint e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, l, q; cin >> n >> l >> q;
	vector<string>s(n);
	rep(i, n)cin >> s[i];
	vector<segtree<mint, op, e>> seg(n);
	vector<mint>pw27(l, 1);
	rep2(i, 1, l)pw27[i] = pw27[i - 1] * 27;
	rep(i, n) {
		vector<mint>v(l);
		rep(j, l) {
			v[j] = pw27[j] * (1 + s[i][j] - 'a');
		}
		seg[i] = segtree<mint, op, e>(v);
	}
	while (q--) {
		int t;
		cin >> t;
		if (1 == t) {
			int k; cin >> k;
			k--;
			char c, d; cin >> c >> d;
			rep(i, n) {
				if (c == s[i][k]) {
					seg[i].set(k, pw27[k] * (1 + d - 'a'));
					s[i][k] = d;
				}
			}
		}
		else {
			string t; cin >> t;
			mint hash = 0;
			rep(i, t.size()) {
				hash += pw27[i] * (1 + t[i] - 'a');
			}
			int ans = 0;
			rep(i, n) {
				auto get = seg[i].prod(0, t.size());
				if (get == hash)ans++;
			}
			cout << ans << endl;
		}
	}
	return 0;
}