/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d)                                                   \
    for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d)                                                  \
    for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d)                                                       \
    for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d)                                                      \
    for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                \
    sort(ALL(c));                                                              \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

// 前方宣言
template <typename T> istream &operator>>(istream &is, vc<T> &vec);
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec);
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec);
template <typename T, size_t _Nm>
istream &operator>>(istream &is, array<T, _Nm> &arr);
template <typename T, size_t _Nm>
ostream &operator<<(ostream &os, const array<T, _Nm> &arr);
template <typename T, size_t _Nm>
ostream &operator>>(ostream &os, const array<T, _Nm> &arr);
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var);
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var);
template <class T> ostream &out_iter(ostream &os, const T &map_var);
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var);
template <typename T, typename U>
ostream &operator<<(ostream &os, const um<T, U> &map_var);
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var);
template <typename T>
ostream &operator<<(ostream &os, const queue<T> &queue_var);
template <typename T> ostream &operator<<(ostream &os, const stack<T> &stk_var);

template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec)
        is >> x;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T>
ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm>
istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm>
ostream &operator<<(ostream &os,
                    const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end())
            os << ", ";
    }
    return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end())
            os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) {
    return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty())
            os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args>
ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) {
    operator<< <0, true>(std::cout, a);
}

void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    std::cout << head;
    if (sizeof...(Tail) > 0)
        std::cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0)
        DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                         \
    type __VA_ARGS__;                                                          \
    assert((std::cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) {
    return is >> rhs;
}
template <typename T> ostream &operator,(ostream &os, const T &rhs) {
    return os << ' ' << rhs;
}

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), std::cin.tie(nullptr),
            std::cout.tie(nullptr);
        std::cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH)
            std::cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region dynamic_rolling_hash */

inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }

// 【フェニック木（アーベル群）】
/*
 * fenwick_tree<S, op, o, inv>(int n) : O(n)
 *	a[0..n) = o() で初期化する．要素はアーベル群 (S, op, o, inv)
 *の元とする．
 *
 * fenwick_tree<S, op, o, inv>(vS a) : O(n)
 *	配列 a[0..n) で初期化する．
 *
 * set(int i, S x) : O(log n)
 *	a[i] = x とする．
 *
 * S get(int i) : O(log n)
 *	a[i] を返す．
 *
 * S sum(int l, int r) : O(log n)
 *	Σa[l..r) を返す．空なら o() を返す．
 *
 * add(int i, S x) : O(log n)
 *	a[i] += x とする．
 *
 * int max_right(function<bool(S)>& f) : O(log n)
 *	f( Σa[0..r) ) = true となる最大の r を返す．
 *   制約：f( o() ) = true，f は単調
 */
template <class S, S (*op)(S, S), S (*o)(), S (*inv)(S)> class fenwick_tree {
    // 参考：https://algo-logic.info/binary-indexed-tree/

    // ノードの個数（要素数 + 1）
    int n;

    // v[i] : Σa[*..i] の値（i:1-indexed，v[0] は不使用）
    vector<S> v;

    // Σa[1..r] を返す．空なら o() を返す．（r:1-indexed）
    S sum_sub(int r) const {
        S res = o();

        // 根に向かって累積 op() をとっていく．
        while (r > 0) {
            res = op(res, v[r]);

            // r の最下位ビットから 1 を減算することで次の位置を得る．
            r -= r & -r;
        }
        return res;
    }

  public:
    // a[0..n) = o() で初期化する．
    fenwick_tree(int n_) : n(n_ + 1), v(n, o()) {}

    // 配列 a[0..n) で初期化する．
    fenwick_tree(const vector<S> &a) : n(ISIZE(a) + 1), v(n) {
        // verify : https://judge.yosupo.jp/problem/point_add_range_sum

        // 配列の値を仮登録する．
        REP(i, 0, n - 1) v[i + 1] = a[i];

        // 正しい値になるよう根に向かって累積 op() をとっていく．
        for (int pow2 = 1; 2 * pow2 < n; pow2 *= 2) {
            for (int i = 2 * pow2; i < n; i += 2 * pow2) {
                v[i] = op(v[i], v[i - pow2]);
            }
        }
    }
    fenwick_tree() : n(0) {}

    // a[i] = x とする．（i : 0-indexed）
    void set(int i, S x) {
        // 差分を求める．
        S d = op(x, inv(get(i)));

        add(i, d);
    }

    // a[i] を返す．（i : 0-indexed）
    S get(int i) const { return sum(i, i + 1); }

    // Σa[l..r) を返す．空なら o() を返す．（l, r : 0-indexed）
    S sum(int l, int r) const {
        // verify : https://judge.yosupo.jp/problem/point_add_range_sum

        if (l >= r)
            return o();

        // 0-indexed での半開区間 [l, r) は，
        // 1-indexed での閉区間 [l + 1, r] に対応する．
        // よって閉区間 [1, r] の総和から閉区間 [1, l] の総和を引けば良い．
        return op(sum_sub(r), inv(sum_sub(l)));
    }

    // a[i] += x とする．（i : 0-indexed）
    void add(int i, S x) {
        // verify : https://judge.yosupo.jp/problem/point_add_range_sum

        // i を 1-indexed に直す．
        i++;

        // 根に向かって値を op() していく．
        while (i < n) {
            v[i] = op(v[i], x);

            // i の最下位ビットに 1 を加算することで次の位置を得る．
            i += i & -i;
        }
    }

    // f( Σa[0..r) ) = true となる最大の r を返す．（r : 0-indexed）
    int max_right(const function<bool(S)> &f) const {
        // verify : https://www.spoj.com/problems/ALLIN1/

        S x = o();

        // 注目している閉区間は [l+1, r] で幅は len
        int l = 0;
        for (int len = 1 << msb(n - 1); len > 0; len = len >> 1) {
            int r = l + len;

            if (r < n && f(op(x, v[r]))) {
                x = op(x, v[r]);
                l = r;
            }
        }
        return l;
    }

#ifdef _MSC_VER
    friend ostream &operator<<(ostream &os, const fenwick_tree &ft) {
        rep(i, ft.n - 1) { os << ft.get(i) << " "; }
        return os;
    }
#endif
};

// 【動的ローリングハッシュ（列）】
/*
 * Rolling_hash<STR>(STR s) : O(n)
 *	列 s[0..n) で初期化する．
 *	制約：STR は string，vector<T> など．ll 範囲の負数は扱えない．
 *
 * ull get(int l, int r) : O(log n)
 *	部分文字列 s[l..r) のハッシュ値を返す（空なら 0）
 *
 * void set(int i, ull x) : O(log n)
 *	s[i] = x とする．
 *
 * 利用：【フェニック木（アーベル群）】
 */
constexpr ull opdrh(ull x, ull y) {
    ull a = x + y, ah = a >> 61, al = a & ((1ULL << 61) - 1), res = ah + al;
    if (res >= ((1ULL << 61) - 1))
        res -= ((1ULL << 61) - 1);
    return res;
}
constexpr ull odrh() { return 0ULL; }
constexpr ull invdrh(ull a) { return ((1ULL << 61) - 1) ^ a; }
template <class STR> class dynamic_rolling_hash {
    // 参考 : https://qiita.com/keymoon/items/11fac5627672a6d6a9f6

    static constexpr ull MASK30 = (1ULL << 30) - 1;
    static constexpr ull MASK31 = (1ULL << 31) - 1;
    static constexpr ull MOD = (1ULL << 61) - 1; // 法（素数）

    // a mod (2^61 - 1) を返す．
    inline ull get_mod(ull a) const {
        ull ah = a >> 61, al = a & MOD;
        ull res = ah + al;
        if (res >= MOD)
            res -= MOD;
        return res;
    }

    // x ≡ a b mod (2^61 - 1) なる x < 2^63 を返す（ただし a, b < 2^61）
    inline ull mul(ull a, ull b) const {
        ull ah = a >> 31, al = a & MASK31;
        ull bh = b >> 31, bl = b & MASK31;

        ull c = ah * bl + bh * al;
        ull ch = c >> 30, cl = c & MASK30;

        ull term1 = 2 * ah * bh;
        ull term2 = ch + (cl << 31);
        ull term3 = al * bl;

        return term1 + term2 + term3; // < 2^63
    }

    static constexpr ull BASE = 1234567891011; // 適当な基数
    static constexpr ull BASE_INV = 212042116942762790ULL;
    static constexpr ull SHIFT = 4295090752; // 適当なシフト

    // 列の長さ
    int n;

    // powB[i] : BASE^i
    vector<ull> powB, powB_inv;

    // v[i] : (s[i] + SHIFT) BASE^(-i)
    fenwick_tree<ull, opdrh, odrh, invdrh> v;

  public:
    // 列 s[0..n) で初期化する．
    dynamic_rolling_hash(const STR &s)
        : n(ISIZE(s)), powB(n + 1), powB_inv(n + 1) {
        // verify :
        // https://mojacoder.app/users/Tonegawac/problems/dynamic_string_point_set

        powB[0] = powB_inv[0] = 1;
        REP(i, 0, n) {
            powB[i + 1] = get_mod(mul(powB[i], BASE));
            powB_inv[i + 1] = get_mod(mul(powB_inv[i], BASE_INV));
        }

        vector<ull> ini(n);
        REP(i, 0, n) ini[i] = get_mod(mul((ull)s[i] + SHIFT, powB_inv[i]));
        v = fenwick_tree<ull, opdrh, odrh, invdrh>(ini);
    }
    dynamic_rolling_hash() : n(0) {}

    // s[l..r) のハッシュ値の取得
    ull get(int l, int r) const {
        // verify :
        // https://mojacoder.app/users/Tonegawac/problems/dynamic_string_point_set

        chmax(l, 0);
        chmin(r, n);
        if (l >= r)
            return 0;

        return get_mod(mul(v.sum(l, r), powB[r - 1]));
    }

    // s[i] = x とする．
    void set(int i, ull x) {
        // verify :
        // https://mojacoder.app/users/Tonegawac/problems/dynamic_string_point_set

        assert(0 <= i && i < n);

        v.set(i, get_mod(mul(x + SHIFT, powB_inv[i])));
    }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, n, l, q);
    vs s(n);
    cin >> s;

    vc<dynamic_rolling_hash<string>> drhs(n);
    REP(i, 0, n) {
        drhs[i] = dynamic_rolling_hash<string>(s[i]); //
    }

    REP(qi, 0, q) {
        VAR(ll, type);
        if (type == 1) {
            VAR(ll, k);
            VAR(char, c, d);
            --k;
            REP(i, 0, n) {
                if (s[i][k] == c) {
                    drhs[i].set(k, d);
                    s[i][k] = d;
                }
            }
        } else {
            VAR(string, t);
            dynamic_rolling_hash<string> drh(t);
            const ull needle = drh.get(0, SIZE(t));
            ll ans = 0;
            REP(i, 0, n) {
                const ull result = drhs[i].get(0, SIZE(t));
                if (result == needle) {
                    ++ans;
                }
            }
            pprint(ans);
        }
    }
}

// entry point
int main() {
    solve();
    return 0;
}