#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

using ull = uint64_t;
const ull MASK30 = (1UL << 30) - 1;
const ull MASK31 = (1UL << 31) - 1;
const ull MOD = ((ull)1 << 61) - 1;
const ull MASK61 = MOD;
ull BASE; //基底
vector<ull> CharToHash; //英小文字 → hash
unordered_map<ull,char> HashToChar; //hash → 英小文字
unordered_map<ull,int> idx; //hash-index(挿入順番号)
        
template<char BASE_CHAR>
struct RollingHashSystem{
    vs regStr; // 登録した文字列
    int str_num = 0; //挿入した文字列の総数
    RollingHashSystem(){
        CharToHash = vector<ull>(26);
        ull mx = 0;
        srand(time(NULL));
        rep(i,26){
            ull y = rand()+1;
            while(HashToChar.count(y)){
                y = rand()+1;
            }
            HashToChar[y] = BASE_CHAR + i;
            CharToHash[i] = y;
            chmax(mx,y);
        }
    
        ull base_tmp = 37;
        while(1){
            int k = rand()+1;
            if (gcd(MOD,k) != 1) continue;
            BASE = PowMod(base_tmp , k);
            if (BASE <= mx) continue;
            break;
        }
    };
    //a*b mod 2^61-1を返す関数(最後にModを取る)
    ull Mul(ull a, ull b)
    {
        a = (a + MOD) % MOD;
        b = (b + MOD) % MOD;
        ull au = a >> 31;
        ull ad = a & MASK31;
        ull bu = b >> 31;
        ull bd = b & MASK31;
        ull mid = ad * bu + au * bd;
        ull midu = mid >> 30;
        ull midd = mid & MASK30;
        return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);
    }
    //mod 2^61-1を計算する関数
    ull CalcMod(ull x)
    {
        ull xu = x >> 61;
        ull xd = x & MASK61;
        ull res = xu + xd;
        if (res >= MOD) res -= MOD;
        return res;
    }
    ull PowMod(ull base, ull exp) { // base^exp mod MOD
        if (exp == 0) {
            return 1;
        } else if (exp % 2 == 0) {
            ull t = PowMod(base, exp / 2);
            return Mul(t, t);
        } else {
            return Mul(base, PowMod(base, exp - 1));
        }
    }
    ull Inv(ull base){
        return PowMod(base, MOD-2);
    }
    ull GetHash(string s){ // 文字列sのhashを取得
        ull now = 0;
        int n = sz(s);
        rrep(i,n){
            now = Mul(now,BASE) + CharToHash[s[i]-'a'];
        }
        return now;
    }
    ull GetConnectHash(ull h1, ull h2, int h2len){
        ull ret = Mul(h1, PowMod(BASE, h2len)) + h2;
        if(ret >= MOD) ret -= MOD;
        return ret;
    }
    ull Register(string s){ // 文字列sにhashを割り当て保存
        ull hash = GetHash(s);
        if (idx.count(hash)){
            return hash;
        }
        idx[hash] = str_num;
        regStr.pb(s);
        str_num++;
        return hash;
    }
    string GetRegStr(ull hash){ // hashをもつ文字列を取得
        string ret = "";
        if (idx.count(hash)){
            ret = regStr[idx[hash]];
        }
        return ret;
    }
    int GetIdx(string s){ // 文字列sの挿入順番号を取得
        ull hash = GetHash(s);
        int ret = -1;
        if (idx.count(hash)) ret = idx[hash];
        return ret;
    }
    int GetIdx(ull hash){ // hashをもつ文字列のidxを取得
        int ret = -1;
        if (idx.count(hash)) ret = idx[hash];
        return ret;
    }
};
RollingHashSystem<'a'> RHS;

struct Hash{
    ull hash;

    // hashのキーに指定させるために使用
    // 使用例 : unordered_map<Hash, int, Hash::Hasher>
    struct Hasher {
        std::size_t operator()(const Hash& h) const {
            return std::hash<ull>{}(h.hash);
        }
    };
    Hash(){
        hash = 0;
    }
    template<typename T>
    Hash(T a){
        hash = static_cast<ull>(a);
    }
    Hash(const Hash& a){
        hash = a.hash;
    }
    Hash& operator=(const Hash& a){
        hash = a.hash;
        return *this;
    }
    Hash& operator+=(const Hash& a){
        hash += a.hash;
        if (hash >= MOD) hash -= MOD;
        return *this;
    }
    Hash& operator-=(const Hash& a){
        hash = hash + MOD - a.hash;
        if (hash >= MOD) hash -= MOD;
        return *this;
    }
    Hash& operator*=(const Hash& a){
        hash = RHS.Mul(hash, a.hash);
        return *this;
    }
    Hash& operator/=(const Hash& a){
        hash = RHS.Mul(hash, RHS.Inv(a.hash));
        return *this;
    }
    Hash& operator++(){
        *this += 1;
        return *this;
    }
    Hash& operator--(){
        *this -= 1;
        return *this;
    }
    friend Hash operator+(const Hash& a, const Hash& b){
        return Hash(a) += b;
    }
    friend Hash operator-(const Hash& a, const Hash& b){
        return Hash(a) -= b;
    }
    friend Hash operator*(const Hash& a, const Hash& b){
        return Hash(a) *= b;
    }
    friend Hash operator/(const Hash& a, const Hash& b){
        return Hash(a) /= b;
    }
    bool operator==(const Hash& a) const {
        return hash==a.hash;
    }
    bool operator!=(const Hash& a) const {
        return hash!=a.hash;
    }
    ull val() const {
        return hash;
    }
};

ull op(ull a,ull b){
    ull c = a+b;
    if (c >= MOD) c -= MOD;
    return c;
}
 
ull e(){
    return 0;
}
 
ull mapping(ull p,ull a){
    ull b = a+p;
    if (b >= MOD) b -= MOD;
    return b;
}
 
ull composition(ull p,ull q){
    ull b = p+q;
    if (b >= MOD) b -= MOD;
    return b;
}
 
ull id(){
    return 0;
}


struct RH{
    vector<ull> hashed, power;//1-indexed
    lazy_segtree<ull , op , e , ull , mapping , composition , id> ls;
    string s;
    int n;
    RH(){

    }
    RH(string s_) : s(s_){
        n = sz(s);
        hashed = vector<ull>(n+1,0); power = vector<ull>(n+1,0);
        power[0] = 1;
        rep(i,n){
            power[i+1] = RHS.Mul(power[i], BASE); 
            hashed[i+1] = hashed[i] + RHS.Mul(CharToHash[s[i]-'a'], power[i]);
            if (hashed[i+1] >= MOD) hashed[i+1] -= MOD;
        }
        ls = lazy_segtree<ull , op , e , ull , mapping , composition , id>(n);
        rep(i,n) ls.set(i, hashed[i+1]);
    };
    Hash get(ull l, ull r) const {// [l,r)のhash取得
        ull ret = hashed[r] + MOD - RHS.Mul(hashed[l], power[r - l]);
        if(ret >= MOD) ret -= MOD;
        return Hash(ret);
    }
    void connect(const string &s){
        int n = hashed.size() - 1, m = s.size();
        hashed.resize(n + m + 1);
        power.resize(n + m + 1);
        for(int i = n; i < n + m; i++) {
            power[i + 1] = RHS.Mul(power[i], BASE);
            hashed[i + 1] = RHS.Mul(hashed[i], BASE) + CharToHash[s[i]-'a'];
            if(hashed[i + 1] >= MOD) hashed[i + 1] -= MOD;
        }
    }
    int LCP(const RH &b, int l1, int r1, int l2, int r2) {
        int len = min(r1 - l1, r2 - l2);
        int low = 0, high = len + 1;
        while(high - low > 1) {
            int mid = (low + high) / 2;
            if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;
            else high = mid;
        }
        return low;
    }
};

// RollingHashSystem と RH
// 各文字列をRHでハッシュ化、RollingHashSystemは共通機能をまとめたもの

// RollingHashSystem
// メンバ変数
// vector<ull> CharToHash : 文字 → hash
// unordered_map<ull,char> HashToChar : hash → 文字
// unordered_map<ull,int> idx : hash-index(挿入順番号)
// vs regStr : 登録された文字列
// int str_num = 0 : 挿入した文字列の総数
// ull BASE : 基底

// メンバ関数
// ull Mul(ull a, ull b) : a*b mod 2^61-1を返す関数(最後にModを取る)
// ull CalcMod(ull x) : mod 2^61-1を計算する関数
// ull PowMod(ull base, ull exp) : base^exp mod MOD
// ull GetHash(string s) : 文字列sのhashを取得
// ull GetConnectHash(ull h1, ull h2, int h2len) : ハッシュh1の文字列の末尾に、ハッシュh2・文字数h2lenの文字列を加えた文字列のハッシュを取得
// ull Register(string s) : 文字列sにhashを割り当て保存
// string GetRegStr(ull hash) : hashをもつ登録済みの文字列を取得、O(str_num)
// int GetIdx(string s) : 文字列sの挿入順番号を取得
// int GetIdx(ull hash) : hashをもつ文字列のidxを取得

// Hash
// ハッシュクラス。MODの四則演算へのアクセスを簡易化したもの。
// 0<= hash < MOD を前提としたつくりになっていることに注意。バグが発生したときこの前提が崩れていないかを確認する。

// RH
// ull get(ull l, ull r) : 部分文字列[l,r)のhash取得
// void connect(const string &s) : 文字列sを末尾に追加
// ull LCP(const RH &b, int l1, int r1, int l2, int r2) : 部分文字列[l1,r1)と文字列sの部分文字列[l2,r2)の最長共通接頭辞の文字数


void solve(){
    int n,l,q; cin>>n>>l>>q;
    vector<RH> rh(n);
    vs s(n);
    rep(i,n){
        cin>>s[i];
        rh[i] = RH(s[i]);
    }
    vi ans;
    rep(i,q){
        int tt; cin>>tt;
        if (tt==1){
            int k; cin>>k; k--;
            char c,d; cin>>c>>d;
            rep(j,n){
                if (s[j][k]==c){
                    s[j][k] = d;
                    ull h1 = RHS.Mul(CharToHash[c-'a'], rh[j].power[k]);
                    ull h2 = RHS.Mul(CharToHash[d-'a'], rh[j].power[k]);
                    ull dif;
                    if (h1 > h2) dif = MOD-h1+h2;
                    else dif = h2-h1;
                    if (dif>=MOD) dif -= MOD;
                    rh[j].ls.apply(k,l,dif);
                }
            }
        }else{
            string t; cin>>t;
            RH r(t);
            int k = sz(t);
            int tmp = 0;
            rep(j,n) if (r.hashed[k] == rh[j].ls.get(k-1)) ++tmp;
            ans.pb(tmp);
        }
    }
    outv;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}