#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<map>

#define ll unsigned long long

using namespace std;

const int N=2e5+,base=;

int n,tot,c[N][],fa[N],rt,siz[N];

ll val[N],sm[N],pw[N];

char ch[N];

int init()

{

    pw[]=;

    for(int i=;i<=N-;i++) pw[i]=pw[i-]*base;

}

void pshp(int cr)

{

    int ls=c[cr][],rs=c[cr][];

    siz[cr]=siz[ls]+siz[rs]+;

    val[cr]=(val[rs]*base+sm[cr])*pw[siz[ls]]+val[ls];

}

void rotate(int x,int &k)

{

    int y=fa[x],z=fa[y];

    if(y==k) k=x;

    else c[z][y==c[z][]]=x;

    int d=(x==c[y][]);

    fa[x]=z; fa[y]=x; fa[c[x][!d]]=y;

    c[y][d]=c[x][!d]; c[x][!d]=y;

    pshp(y); pshp(x);

}

void splay(int x,int &k)

{

    while(x!=k)

    {

        int y=fa[x],z=fa[y];

        if(y!=k)

        {

            if((x==c[y][])^(y==c[z][]))

                rotate(x,k);

            else rotate(y,k);

        }

        rotate(x,k);

    }

}

int find(int p)

{

    int cr=rt;

    while(cr)

    {

        if(siz[c[cr][]]+==p)return cr;

        else if(siz[c[cr][]]+<p)

        {

            p-=siz[c[cr][]]+;

            cr=c[cr][];

        }

        else cr=c[cr][];

    }

}

int nxt(int cr)

{

    cr=c[cr][];

    while(c[cr][]) cr=c[cr][];

    return cr;

}

void insert(int p,int v)

{

    int d=find(p); splay(d,rt);

    int x=nxt(d);  splay(x,c[rt][]);

    siz[++tot]=; val[tot]=sm[tot]=v;

    fa[tot]=x;  c[x][]=tot;

    pshp(x);  pshp(d);

}

void mdfy(int p,int v)

{

    int d=find(p); splay(d,rt);

    sm[d]=v; pshp(d);

}

ll cz(int u,int v)

{

    splay(u,rt);

    int k=find(v);

    splay(k,c[rt][]);

    return val[c[k][]];

}

void query(int u,int v)

{

    int l=,r=min(tot-u,tot-v);

    int ans=;

    int x=find(u-), y=find(v-);

    while(l<=r)

    {

        int mid=l+r>>;

        if(cz(x,u+mid)==cz(y,v+mid)) ans=mid,l=mid+;

        else r=mid-;

    }

    printf("%d\n",ans);

}

void build(int l,int r,int lst,bool fx)

{

    if(l>r) return;

    int mid=l+r>>;

    int cr=++tot; fa[cr]=lst; c[lst][fx]=cr;

    sm[cr]=ch[mid]-'a'+;

    if(l==r) {val[cr]=sm[cr]; siz[cr]=; return;}

    build(l,mid-,cr,); build(mid+,r,cr,);

    pshp(cr);

}

int main()

{

    init();

    scanf("%s",ch+); n=strlen(ch+);

    ch[]='a'; ch[n+]='a'; n+=;

    build(,n,,); rt=; c[][]=;

    scanf("%d",&n);

    for(int i=,x,d;i<=n;i++)

    {

        cin>>ch[];

        if(ch[]=='I')

        {

            scanf("%d %c",&x,&ch[]);

            d=ch[]-'a'+; insert(x+,d);

        }

        if(ch[]=='R')

        {

            scanf("%d %c",&x,&ch[]);

            d=ch[]-'a'+; mdfy(x+,d);

        }

        if(ch[]=='Q')

        {

            scanf("%d%d",&x,&d);

            query(x+,d+);

        }

    }

    return ;

}