#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
//using mint = modint998244353;
using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


mint p[3010];
struct S {
    int n; mint val;
};
S op(S l, S r) { return S{l.n+r.n, l.val*p[r.n]+r.val}; }
S e() { return S{0, 0}; }

int main() {
    int n, l, q;
    cin >> n >> l >> q;
    vector<string> s(n);
    cin >> s;

    p[0] = 1;
    rep(i, l) p[i+1] = p[i] * (1<<8);

    vector<segtree<S, op, e>> sst(n, segtree<S, op, e>(l));
    rep(i, n) rep(j, l) sst[i].set(j, S{1, s[i][j]});
    while(q--) {
        int qt;
        cin >> qt;
        if(qt == 1) {
            int k; char c, d;
            cin >> k >> c >> d;
            k--;
            rep(i, n) if(s[i][k] == c) {
                s[i][k] = d;
                sst[i].set(k, S{1, d});
            }
        } else {
            string t;
            cin >> t;
            mint hash = 0;
            rep(i, t.size()) hash *= (1<<8), hash += t[i];
            int ans = 0;
            rep(i, n) if(sst[i].prod(0, t.size()).val == hash) ans++;
            cout << ans << '\n';
        }
    }
    return 0;
}