//Start: 2024-12-25 14:40:33
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"(func %s, line #%d): " fmt, __func__, __LINE__, ##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=2e5+5,S=2005,Bs=37;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
inline int read(){
  char ch=getchar();int x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
int n,q;char s[N];
int siz,tot,bel[N],L[S],R[S];
ull pw[N];
struct Block{
  ull pnt[N],blc[S];char s[N];
  void build(char *S){
    For(i,1,n) s[i]=S[i];
    For(i,1,tot){
      pnt[L[i]]=s[L[i]]-'a'+1;
      For(j,L[i]+1,R[i]) pnt[j]=pnt[j-1]*Bs+(s[j]-'a'+1);
      blc[i]=blc[i-1]*pw[R[i]-L[i]+1]+pnt[R[i]];
    }
  }void update(int x,int c){
    s[x]=c+'a'-1;int id=bel[x];
    if(x==L[id]) pnt[x]=c,x++;
    For(i,x,R[id]) pnt[i]=pnt[i-1]*Bs+s[i]-'a'+1;
    For(i,id,tot) blc[i]=blc[i-1]*pw[R[i]-L[i]+1]+pnt[R[i]];
  }ull query(int x){return blc[bel[x]-1]*pw[x-L[bel[x]]+1]+pnt[x];}
  ull query(int l,int r){return query(r)-query(l-1)*pw[r-l+1];}
}F_blc,R_blc;
struct node{int l,r,d;node(int _l,int _r,int _d):l(_l),r(_r),d(_d){}};
struct Node{int l,r;vector<node>pre,suf;}T[N<<2];
bool inQuery=0;
vector<node>Merge(Node A,Node B,Block& F_blc,Block& R_blc){
  static vector<node>res;res.clear();
  auto emplace=[&](node x){
    if(A.l+x.r-1>B.r){
      if(x.l==x.r) return;
      x.r-=x.d;
    }if(x.l>x.r) return;
    if(!res.empty()&&(res.back().d==x.d||x.l==x.r)&&(res.back().r+res.back().d==x.l||res.back().r==x.l))
      res.back().r=x.r;
    else if(!res.empty()&&res.back().l==res.back().r&&x.l==x.r&&res.back().l!=x.l)
      res.back().r=x.r,res.back().d=x.r-res.back().l;
    else res.emplace_back(x);
  };
  for(auto x within B.suf) emplace(x);  
  reverse(B.pre.begin(),B.pre.end());
  for(auto [l,r,d] within B.pre){
    int pl=B.l+l-1,pr=B.l+r-1;
    int lenC=B.r-pr;
    if(lenC<d&&l!=r&&F_blc.query(pl+1,pl+lenC)==F_blc.query(pr+1,B.r)){
      int L=0,R=min(A.r-A.l+1-lenC,r-l)/d,ans=-1;
      while(L<=R){
        int mid=(L+R)>>1;
        if(F_blc.query(pl+1,pl+mid*d)*pw[lenC]+F_blc.query(pr+1,B.r)==R_blc.query(n+1-A.r,n+1-(A.r-mid*d-lenC+1)))
          L=(ans=mid)+1;
        else R=mid-1;
      }
      if(ans!=-1) emplace(node(B.r-B.l+1+lenC,B.r-B.l+1+lenC+d*ans,d));
    }else{
      int L=0,R=(r-l)/d,ans=0;
      while(L<=R){
        int mid=(L+R)>>1;
        if(F_blc.query(B.l+l,B.l+l+mid*d-1)==R_blc.query(n+1-A.r,(n+1)-(A.r-mid*d+1)))
          L=(ans=mid)+1;
        else R=mid-1;
      }int pos=A.r-ans*d;
      if(pos-A.l+1>=lenC&&F_blc.query(B.l+r,B.r)==R_blc.query(n+1-pos,n+1-(pos-lenC+1)))
        emplace(node(B.r-(pos-lenC+1)+1,B.r-(pos-lenC+1)+1,1));
    }
  }
  if(B.r-B.l+1<=A.r-A.l+1&&F_blc.query(B.l,B.r)==R_blc.query(n+1-A.r,n+1-(A.r-(B.r-B.l+1)+1)))
    emplace(node(2*(B.r-B.l+1),2*(B.r-B.l+1),1));
  for(auto [l,r,d] within A.suf){
    int pl=A.r-l+1,pr=A.r-r+1;
    int L=0,R=min((B.r-B.l+1)/d,(r-l)/d),ans=0;
    while(L<=R){
      int mid=(L+R)>>1;
      if(F_blc.query(B.l,B.l+mid*d-1)==R_blc.query(n+1-(A.r-l),n+1-(A.r-(l+mid*d-1))))
        L=(ans=mid)+1;
      else R=mid-1;
    }int lenD=B.r-B.l+1-ans*d;
    if(lenD<d&&A.r-(l+lenD-1)>A.l&&F_blc.query(B.r-lenD+1,B.r)==R_blc.query(n+1-(A.r-l),n+1-(A.r-(l+lenD-1))))
      emplace(node(2*(B.r-B.l+1)+l,B.r-B.l+1+r-d+lenD,d));
    if(pr-lenD>=A.l&&F_blc.query(B.r-lenD+1,B.r)==R_blc.query(n+1-(pr-1),n+1-(pr-lenD)))
      emplace(node(lenD+r+B.r-B.l+1,lenD+r+B.r-B.l+1,1));
  }return res;
}
Node operator+(Node a,Node b){
  Node c;c.l=a.l;c.r=b.r;
  c.suf=Merge(a,b,F_blc,R_blc);
  a.l=n-a.l+1;a.r=n-a.r+1;b.l=n-b.l+1;b.r=n-b.r+1;
  swap(a.l,a.r);swap(b.l,b.r);
  swap(a.pre,a.suf);swap(b.pre,b.suf);
  c.pre=Merge(b,a,R_blc,F_blc);
  // if(inQuery){
  //   Debug("%d %d\n",c.l,c.r);
  //   for(auto [l,r,d] within c.pre) debug("%d %d %d\n",l,r,d);debug("\n");
  //   for(auto [l,r,d] within c.suf) debug("%d %d %d\n",l,r,d);debug("\n");
  // }
  // assert(c.pre.size()<=__lg(c.r-c.l+1)+3);
  // assert(c.suf.size()<=__lg(c.r-c.l+1)+3);
  return c;
}
void build(int l=1,int r=n,int rt=1){
  T[rt].l=l;T[rt].r=r;
  if(l==r){T[rt].pre=T[rt].suf={{0,1,1}};return;}
  int mid=(l+r)>>1;
  build(l,mid,rt<<1);build(mid+1,r,rt<<1|1);
  T[rt]=T[rt<<1]+T[rt<<1|1];
}
void update(int L,int l=1,int r=n,int rt=1){
  if(l==r) return;
  int mid=(l+r)>>1;
  if(L<=mid) update(L,l,mid,rt<<1);
  else update(L,mid+1,r,rt<<1|1);
  T[rt]=T[rt<<1]+T[rt<<1|1];
}
Node query(int L,int R,int l=1,int r=n,int rt=1){
  if(L==l&&R==r) return T[rt];
  int mid=(l+r)>>1;
  if(R<=mid) return query(L,R,l,mid,rt<<1);
  if(L>mid) return query(L,R,mid+1,r,rt<<1|1);
  return query(L,mid,l,mid,rt<<1)+query(mid+1,R,mid+1,r,rt<<1|1);
}
void print(int l=1,int r=n,int rt=1){
  Debug("%d %d\n",l,r);
  for(auto [l,r,d] within T[rt].pre) debug("%d %d %d\n",l,r,d);debug("\n");
  for(auto [l,r,d] within T[rt].suf) debug("%d %d %d\n",l,r,d);debug("\n");
  if(l==r) return;
  int mid=(l+r)>>1;print(l,mid,rt<<1);print(mid+1,r,rt<<1|1);
}
signed LJY(){
  // freopen("data.in","r",stdin);
  // freopen("test.out","w",stdout);
  scanf("%s",s+1);n=strlen(s+1);siz=sqrt(n);
  pw[0]=1;For(i,1,n) pw[i]=pw[i-1]*Bs;
  tot=(n-1)/siz+1;For(i,1,tot) L[i]=R[i-1]+1,R[i]=R[i-1]+siz;R[tot]=n;
  For(i,1,tot) For(j,L[i],R[i]) bel[j]=i;
  F_blc.build(s);reverse(s+1,s+1+n);R_blc.build(s);reverse(s+1,s+1+n);
  build();int lst=0;q=read();
  // print();
  int Cnt=0;
  while(q--){
    int op=read();
    if(op==1){
      int x=read()^lst;char c=getchar();
      s[x]=c;F_blc.update(x,c-'a'+1);R_blc.update(n-x+1,c-'a'+1);
      update(x);
    }else{
      int l=read()^lst,r=read()^lst;
      Node p=query(l,r);int ans=0;
      // for(auto [l,r,d] within p.suf) debug("%d %d %d\n",l,r,d);
      for(auto [l,r,d] within p.suf) ans+=(r-l)/d+1;
      printf("%d\n",lst=ans-1);
    }
    // if(q%1000==0) debug("%d\n",clock());
  }return 0;
}