#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef unsigned long long ull;
const int MAXN = 2e5+10,base = 13331;
char s[MAXN];
int n,q,lst;

namespace T1{
    ull pw[MAXN],h[MAXN],rh[MAXN];
    void solve(){
        pw[0] = 1; for(int i=1;i<=n;i++)pw[i] = pw[i-1]*base;
        while(q--){
            int o; cin>>o;
            if(o==1){
                int x; char c; cin>>x>>c; x ^= lst;
                s[x] = c;
            }else{
                int l,r; cin>>l>>r; l ^= lst,r ^= lst;
                for(int i=1;i<=n;i++)h[i] = h[i-1] * base + (s[i]-'a'+1);
                for(int i=n;i>=1;i--)rh[i] = rh[i+1] * base + (s[i]-'a'+1);
                lst = 0; 
                for(int j=l;j<=r;j++){
                    ull H = h[r] - h[j-1] * pw[r-j+1];
                    ull rH = rh[j] - rh[r+1] * pw[r-j+1];
                    if(H==rH)lst++;
                }
                cout<<lst<<"\n";
            }
        }
    }
}

int main(){
    cin>>(s+1); n = strlen(s+1);
    cin>>q;
    if(max(n,q) <= 5000){
        T1::solve();
        exit(0);
    }

    return 0;
}