#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int N;
int M;
int A[800000];
char S[200000+2];
int res[200000];
int main(){
  int i;
  int st;
  int ed;
  rd(N);
  rd(M);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd((A+300000)[Lj4PdHRW]);
    }
  }
  rd(S);
  st = 300000;
  ed = 300000 + N-1;
  for(i=(0);i<(M);i++){
    if(S[i]=='R'){
      st--;
      ed--;
      A[ed] += A[ed+1];
      A[ed+1] = 0;
    }
    else{
      st++;
      ed++;
      A[st] += A[st-1];
      A[st-1] = 0;
    }
  }
  {
    int RZTsC2BF;
    if(N==0){
      wt_L('\n');
    }
    else{
      for(RZTsC2BF=(0);RZTsC2BF<(N-1);RZTsC2BF++){
        wt_L((A+st)[RZTsC2BF]);
        wt_L(' ');
      }
      wt_L((A+st)[RZTsC2BF]);
      wt_L('\n');
    }
  }
  return 0;
}
// cLay varsion 20200408-1

// --- original code ---
// int N, M, A[8d5];
// char S[2d5+2];
// int res[2d5];
// {
//   int st, ed;
//   rd(N,M,((A+3d5))(N),S);
//   st = 3d5;
//   ed = 3d5 + N-1;
//   rep(i,M){
//     if(S[i]=='R'){
//       st--; ed--;
//       A[ed] += A[ed+1];
//       A[ed+1] = 0;
//     } else {
//       st++; ed++;
//       A[st] += A[st-1];
//       A[st-1] = 0;
//     }
//   }
//   wt(((A+st))(N));
// }