1 #include<cstdio>
  2 #include<algorithm>
  3 #include<cctype>
  4 const int maxe=1e6+1e2;
  5 const double alpha = 0.85;
  6
  7 char in[maxe];
  8 int at[maxe]; // suffix i's node .
  9 double v[maxe];
 10
 11 struct SuffixBalancedTree { // we should insert 0 as the minimal suffix .
 12     int lson[maxe],rson[maxe],siz[maxe],sf[maxe],root,cnt;
 13     int seq[maxe],sql;
 14     int fail,failfa;
 15     double vfl,vfr;
 16
 17     inline bool cmp(int x,int y) {
 18         if( !x || !y ) return !x;
 19         if( in[x] != in[y] ) return in[x] < in[y];
 20         else return v[at[x-1]] < v[at[y-1]];
 21     }
 22     inline void upgrade(int pos,double l,double r) {
 23         siz[pos] = siz[lson[pos]] + siz[rson[pos]] + 1;
 24         if( std::max( siz[lson[pos]] , siz[rson[pos]] ) > siz[pos] * alpha ) fail = pos , failfa = -1 , vfl = l , vfr = r;
 25         else if( fail == lson[pos] || fail == rson[pos] ) failfa = pos;
 26     }
 27     inline void insert(int &pos,double l,double r,const int &id) {
 28         if( !pos ) {
 29             v[at[id]=pos=++cnt]= ( l + r ) / 2.0 , siz[pos] = 1 , sf[pos] = id;
 30             return;
 31         } const double vmid = ( l + r ) / 2.0;
 32         if( cmp(sf[pos],id) ) insert(rson[pos],vmid,r,id) , upgrade(pos,l,r); // id > sf[pos] .
 33         else insert(lson[pos],l,vmid,id) , upgrade(pos,l,r);
 34     }
 35     inline int rebuild(int ll,int rr,double l,double r) {
 36         const int mid = ( ll + rr ) >> 1 , pos = seq[mid];
 37         const double vmid = ( l + r ) / 2.0; v[pos] = vmid , siz[pos] = rr - ll + 1;
 38         if( ll < mid ) lson[pos] = rebuild(ll,mid-1,l,vmid);
 39         if( mid < rr ) rson[pos] = rebuild(mid+1,rr,vmid,r);
 40         return pos;
 41     }
 42     inline void dfs(int pos) {
 43         if(lson[pos]) dfs(lson[pos]);
 44         seq[++sql] = pos;
 45         if(rson[pos]) dfs(rson[pos]);
 46         lson[pos] = rson[pos] = siz[pos] = 0;
 47     }
 48     inline void insert(const int &id) {
 49         fail = 0 , failfa = -1 , insert(root,0,1,id);
 50         if(fail) {
 51             sql = 0 , dfs(fail);
 52             if( ~failfa ) {
 53                 if( fail == lson[failfa] ) lson[failfa] = rebuild(1,sql,vfl,vfr);
 54                 else rson[failfa] = rebuild(1,sql,vfl,vfr);
 55             } else root = rebuild(1,sql,0,1);
 56         }
 57     }
 58 }sbt;
 59
 60 int cov[maxe>>1];
 61
 62 struct SegmentTree {
 63     int mx[maxe<<1];
 64     #define lson(pos) (pos<<1)
 65     #define rson(pos) (pos<<1|1)
 66     inline bool cmp(int a,int b) {
 67         if( cov[a] == cov[b] ) return a < b;
 68         return v[at[cov[a]]] < v[at[cov[b]]];
 69     }
 70     inline void upgrade(int pos) {
 71         mx[pos] = cmp(mx[lson(pos)],mx[rson(pos)]) ? mx[lson(pos)] : mx[rson(pos)];
 72     }
 73     inline void build(int pos,int l,int r) {
 74         if( l == r ) return void( mx[pos] = l );
 75         const int mid = ( l + r ) >> 1;
 76         build(lson(pos),l,mid) , build(rson(pos),mid+1,r) , upgrade(pos);
 77     }
 78     inline void update(int pos,int l,int r,const int &tar) {
 79         if( l == r ) return; // nothing to update .
 80         const int mid = ( l + r ) >> 1;
 81         if( tar <= mid ) update(lson(pos),l,mid,tar);
 82         else update(rson(pos),mid+1,r,tar);
 83         upgrade(pos);
 84     }
 85     inline int query(int pos,int l,int r,const int &ll,const int &rr) {
 86         if( ll <= l && r <= rr ) return mx[pos];
 87         const int mid = ( l + r ) >> 1;
 88         if( rr <= mid ) return query(lson(pos),l,mid,ll,rr);
 89         else if( ll > mid ) return query(rson(pos),mid+1,r,ll,rr);
 90         const int ql = query(lson(pos),l,mid,ll,rr) , qr = query(rson(pos),mid+1,r,ll,rr);
 91         return cmp(ql,qr) ? ql : qr;
 92     }
 93 }sgt;
 94
 95 inline char nextchar() {
 96     static const int BS = 1 << 21;
 97     static char buf[BS],*st=buf+BS,*ed=st;
 98     if( st == ed ) ed = buf + fread(st=buf,1,BS,stdin);
 99     return st == ed ? -1 : *st++;
100 }
101 inline void getstr(char* s) {
102     char c;
103     while( !isalpha(c=nextchar()) );
104     do *s++=c; while( isalpha(c=nextchar()) );
105 }
106 inline char realchar() {
107     char c;
108     while( !isalpha(c=nextchar()) );
109     return c;
110 }
111 inline int getint() {
112     int ret = 0 , ch;
113     while( !isdigit(ch=nextchar()) );
114     do ret=ret*10+ch-'0'; while( isdigit(ch=nextchar()) );
115     return ret;
116 }
117
118 int main() {
119     static int n,m,len,tpe,lastans;
120     n = getint() , m = getint() , len = getint() , tpe = getint() , getstr(in+1) , std::reverse(in+1,in+1+len);
121     for(int i=0;i<=len;i++) in[i] -= 'a' , sbt.insert(i);
122     for(int i=1;i<=n;i++) cov[i] = getint();
123     sgt.build(1,1,n);
124     for(int i=1,o,c,x,l,r;i<=m;i++) {
125         o = realchar();
126         if( o == 'I' ) {
127             c = getint();
128             if( tpe ) c ^= lastans;
129             in[++len] = c , sbt.insert(len);
130         } else if( o == 'C' ) x = getint() , cov[x] = getint() , sgt.update(1,1,n,x);
131         else if( o == 'Q' ) l = getint() , r = getint() , printf("%d\n",lastans=sgt.query(1,1,n,l,r));
132     }
133     return 0;
134 }