#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) (a)=max(a, b)
#define chmin(a, b) (a)=min(a, b)
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;

/*
 for(i=0; i<N; i++)
   cin >> a[i];
*/

ll N, M;
string s;

ll collision_left(ll k) {
  if(k==0) return 1;
  
  ll i;
  for(i=0; i<M; i++) {
    if(s[i]=='L') k--;
    else k++;
    
    if(k==0) return 1;
    
    if(k>=N) k=N-1;
  }
  
  return 0;
}

ll collision_right(ll k) {
  if(k==N-1) return 1;
  
  ll i;
  for(i=0; i<M; i++) {
    if(s[i]=='L') k--;
    else k++;
    
    if(k==N-1) return 1;
    else if(k<0) k=0;
  }
  
  return 0;
}

int main(void) {
  ll i, j, k;
  
  cin >> N >> M;
  ll a[MAX*2];
  
  for(i=0; i<N; i++) cin >> a[i];
  cin >> s;
  
  
  ll l=0, r=N;
  while(l+1<r) {
    ll m=(l+r)/2;
    (collision_left(m) ? l:r)=m;
  }
  ll L=l;
  
  l=0; r=N;
  while(l+1<r) {
    ll m=(l+r)/2;
    (collision_right(m) ? r:l)=m;
  }
  if(collision_right(0)) r--;
  ll R=r;
  
  
  if(L>=R) {
    ll sum=0;
    for(i=0; i<N; i++) sum+=a[i];
    
    k=0;
    for(i=0; i<M; i++) {
      if(s[i]=='L') k--;
      else k++;
      
      if(k<0) k=0;
      else if(k>=N) k=N-1;
    }
    
    
    
    vector<ll> v;
    for(i=0; i<N; i++) {
      if(i==k) v.push_back(sum);
      else v.push_back(0);
    }
    
    for(i=0; i<N; i++) {
      if(i==0) cout << v[i];
      else cout << " " << v[i];
    }
    pt("");
    
  }else {
    ll sl=0, sr=0;
    for(i=0; i<=L; i++) sl+=a[i];
    for(i=R; i<N; i++) sr+=a[i];
    
    k=0;
    for(i=0; i<M; i++) {
      if(s[i]=='L') k--;
      else k++;
      
      if(k<0) k=0;
      else if(k>=N) k=N-1;
    }
    ll lk=k;
    
    k=N-1;
    for(i=0; i<M; i++) {
      if(s[i]=='L') k--;
      else k++;
      
      if(k<0) k=0;
      else if(k>=N) k=N-1;
    }
    ll rk=k;
    
    vector<ll> v;
    for(i=0; i<lk; i++) v.push_back(0);
    v.push_back(sl);
    for(i=lk+1, j=1; i<rk; i++, j++) v.push_back(a[L+j]);
    v.push_back(sr);
    for(i=rk+1; i<N; i++) v.push_back(0);
    
    for(i=0; i<N; i++) {
      if(i==0) cout << v[i];
      else cout << " " << v[i];
    }
    pt("");
  }
  
  
}