#include<cstdio>
const int N=300010,M=N*3;
int n,m,ca,cb,i,j,k,T,h[N],tot;char b[N];
int sa[N],sb[N],ga[N],gb[N],gab[N],v[M],nxt[M],ed;
struct P{int l,r,pre,nxt,t,a;bool b,c,del;}e[N];
inline void read(int&a){char c;while(!(((c=getchar())>='0')&&(c<='9')));a=c-'0';while(((c=getchar())>='0')&&(c<='9'))(a*=10)+=c-'0';}
inline void add(int&x,int y){v[++ed]=y;nxt[ed]=x;x=ed;}
inline int ask(const P&p){return p.a+p.b*(ca-sa[p.t])+p.c*(cb-sb[p.t]);}
inline void cal(P&p){p.b=ask(p)<ask(e[p.pre]);p.c=ask(p)<ask(e[p.nxt]);
}
inline void merge(int o);
inline void check(int o){P&p=e[o],&q=e[p.nxt];int x=ask(p),y=ask(q),z=x<y?y-x:x-y;if(!z)merge(o);bool fa=(x>y)^p.b,fb=(x<y)^q.c;if(fa&&fb){if(ca+cb+z<=m)add(gab[ca+cb+z],o);return;}if(fa){if(ca+z<=m)add(ga[ca+z],o);return;}if(fb){if(cb+z<=m)add(gb[cb+z],o);return;}
}
inline void merge(int o){P&p=e[o];if(p.del||!p.nxt)return;P&q=e[p.nxt];int x=ask(p),y=ask(q);if(x!=y)return;q.del=1;p.r=q.r;p.nxt=q.nxt;if(q.nxt)e[q.nxt].pre=o;p.t=T,p.a=x;cal(p);if(p.pre)check(p.pre);if(p.nxt)check(o);
}
int main(){read(n),read(m);for(i=1;i<=n;i++)read(h[i]);for(i=1;i<=n;i=j){for(j=i;j<=n&&h[i]==h[j];j++);tot++;e[tot].l=i,e[tot].r=j-1;e[tot].a=h[i];}for(i=1;i<tot;i++)e[i].nxt=i+1;for(i=2;i<=tot;i++)e[i].pre=i-1;for(i=1;i<=tot;i++)cal(e[i]);for(i=1;i<tot;i++)check(i);scanf("%s",b+1);for(T=1;T<=m;T++){b[T]=='A'?ca++:cb++;sa[T]=sa[T-1]+(b[T]=='A');sb[T]=sb[T-1]+(b[T]=='B');for(j=ga[ca];j;j=nxt[j])merge(v[j]);for(j=gb[cb];j;j=nxt[j])merge(v[j]);for(j=gab[T];j;j=nxt[j])merge(v[j]);ga[ca]=gb[cb]=0;}for(i=1;i<=tot;i++)if(!e[i].del)for(k=ask(e[i]),j=e[i].l;j<=e[i].r;j++)h[j]=k;for(i=1;i<=n;i++)printf("%d%c",h[i],i<n?' ':'\n');return 0;
}