1 #include<algorithm>
  2 #include<iostream>
  3 #include<cstring>
  4 #include<cstdio>
  5 #include<cmath>
  6 #include<queue>
  7 #define inf 2147483647
  8 #define eps 1e-9
  9 #define ha 19260817
 10 using namespace std;
 11 typedef long long ll;
 12 struct node{
 13     int son[2],siz,v,fa;
 14 }t[200001];
 15 int n,m,x,y,rt,tot,H[200001],num[200001];
 16 char s[100001],op[5],ch[5];
 17 int lr(int u){
 18     return t[t[u].fa].son[1]==u;
 19 }
 20 void updata(int u){
 21     t[u].siz=t[t[u].son[0]].siz+t[t[u].son[1]].siz+1;
 22     t[u].v=(t[t[u].son[0]].v+(ll)num[u]*H[t[t[u].son[0]].siz]%ha+(ll)t[t[u].son[1]].v*H[t[t[u].son[0]].siz+1]%ha)%ha;
 23 }
 24 void rotate(int u){
 25     int f=t[u].fa,ff=t[f].fa,ch=lr(u);
 26     if(ff)t[ff].son[lr(f)]=u;
 27     t[f].son[ch]=t[u].son[ch^1];
 28     t[t[f].son[ch]].fa=f;
 29     t[u].son[ch^1]=f;
 30     t[f].fa=u;
 31     t[u].fa=ff;
 32     updata(f);
 33     updata(u);
 34 }
 35 void splay(int u,int g){
 36     for(;t[u].fa!=g;rotate(u)){
 37         int f=t[u].fa;
 38         if(t[f].fa!=g)rotate(lr(u)==lr(f)?f:u);
 39     }
 40     if(!g)rt=u;
 41 }
 42 int findx(int u,int x){
 43     if(!u)return 0;
 44     if(x==t[t[u].son[0]].siz+1)return u;
 45     else if(x<t[t[u].son[0]].siz+1)return findx(t[u].son[0],x);
 46     else return findx(t[u].son[1],x-t[t[u].son[0]].siz-1);
 47 }
 48 int build(int l,int r,int f){
 49     if(l>r)return 0;
 50     int u=(l+r)/2;
 51     t[u].v=num[u]=s[u]-‘0‘;
 52     t[u].siz=1;
 53     t[u].fa=f;
 54     t[u].son[0]=build(l,u-1,u);
 55     t[u].son[1]=build(u+1,r,u);
 56     updata(u);
 57     return u;
 58 }
 59 void ins(int u,int ch){
 60     int x=findx(rt,u);
 61     splay(x,0);
 62     int y=findx(rt,u+1);
 63     splay(y,x);
 64     int v=++tot;
 65     t[v].v=num[v]=ch;
 66     t[v].siz=1;
 67     t[y].son[0]=v;
 68     t[v].fa=y;
 69     updata(y);
 70     updata(x);
 71 }
 72 void chg(int u,int ch){
 73     int x=findx(rt,u);
 74     splay(x,0);
 75     num[x]=ch;
 76     updata(x);
 77 }
 78 int query(int l,int r){
 79     int x=findx(rt,l-1);
 80     splay(x,0);
 81     int y=findx(rt,r+1);
 82     splay(y,x);
 83     return t[t[y].son[0]].v;
 84 }
 85 int work(int x,int y){
 86     int l=1,r=min(tot-x,tot-y);
 87     while(l<r){
 88         int mid=(l+r)/2;
 89         if(query(x+1,x+mid)==query(y+1,y+mid))l=mid+1;
 90         else r=mid;
 91     }
 92     return l-1;
 93 }
 94 int main(){
 95     H[0]=1;
 96     for(int i=1;i<=200000;i++)H[i]=H[i-1]*27%ha;
 97     scanf("%s%d",s+2,&m);
 98     n=strlen(s+2);
 99     tot=n+2;
100     rt=build(1,n+2,0);
101     for(int i=1;i<=m;i++){
102         scanf("%s",op);
103         if(op[0]==‘Q‘){
104             scanf("%d%d",&x,&y);
105             printf("%d\n",work(x,y));
106         }else if(op[0]==‘R‘){
107             scanf("%d%s",&x,ch);
108             chg(x+1,ch[0]-‘0‘);
109         }else{
110             scanf("%d%s",&x,ch);
111             ins(x+1,ch[0]-‘0‘);
112         }
113     }
114     return 0;
115 }