#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll op1(ll a, ll b) { return (a + b) % mod1; }

ll op2(ll a, ll b) { return (a + b) % mod2; }

ll op3(ll a, ll b) { return (a + b) % mod3; }

ll e() { return 0LL; }

int main() {
    ll N, L, Q;
    cin >> N >> L >> Q;
    vector<string> S(N);
    for (ll i = 0; i < N; i++) {
        cin >> S[i];
    }
    ll l1 = 1009;
    ll l2 = 993;
    ll l3 = 991;
    vector<ll> pow_l1(N + 1);
    vector<ll> pow_l2(N + 1);
    vector<ll> pow_l3(N + 1);
    pow_l1[0] = 1;
    pow_l2[0] = 1;
    pow_l3[0] = 1;
    for (ll i = 0; i < N; i++) {
        pow_l1[i + 1] = (pow_l1[i] * l1) % mod2;
        pow_l2[i + 1] = (pow_l2[i] * l2) % mod2;
        pow_l3[i + 1] = (pow_l3[i] * l3) % mod2;
    }
    vector<segtree<ll, op1, e>> segvec1(N);
    vector<segtree<ll, op2, e>> segvec2(N);
    vector<segtree<ll, op3, e>> segvec3(N);
    for (ll i = 0; i < N; i++) {
        segvec1[i] = segtree<ll, op1, e>(L);
        segvec2[i] = segtree<ll, op2, e>(L);
        segvec3[i] = segtree<ll, op3, e>(L);
        for (ll j = 0; j < L; j++) {
            ll val = (ll)(S[i][j] - 'a');
            segvec1[i].set(j, (pow_l1[j] * val) % mod1);
            segvec2[i].set(j, (pow_l2[j] * val) % mod2);
            segvec3[i].set(j, (pow_l3[j] * val) % mod3);
        }
    }
    for (ll i = 0; i < Q; i++) {
        ll a;
        cin >> a;
        if (a == 1) {
            ll k;
            char c, d;
            cin >> k >> c >> d;
            k--;
            for (ll j = 0; j < N; j++) {
                if (S[j][k] == c) {
                    S[j][k] = d;
                    ll val = (ll)(d - 'a');
                    segvec1[j].set(k, (pow_l1[k] * val) % mod1);
                    segvec2[j].set(k, (pow_l2[k] * val) % mod2);
                    segvec3[j].set(k, (pow_l3[k] * val) % mod3);
                }
            }
        } else {
            string t;
            cin >> t;
            ll len = t.size();
            ll h1 = 0;
            ll h2 = 0;
            ll h3 = 0;
            for (ll j = 0; j < len; j++) {
                ll val = (ll)(t[j] - 'a');
                h1 = (h1 + (val * pow_l1[j]) % mod1) % mod1;
                h2 = (h2 + (val * pow_l2[j]) % mod2) % mod2;
                h3 = (h3 + (val * pow_l3[j]) % mod3) % mod3;
            }
            ll ans = 0;
            for (ll j = 0; j < N; j++) {
                ll val1 = segvec1[j].prod(0, len);
                ll val2 = segvec2[j].prod(0, len);
                ll val3 = segvec3[j].prod(0, len);
                if (val1 == h1 && val2 == h2 && val3 == h3) {
                    ans++;
                }
            }
            cout << ans << endl;
        }
    }
}