#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n,m;cin>>n>>m;
    vector<ll> a(n);
    rep(i,n) cin>>a[i];
    string s;cin>>s;
    
    int l=0,r=n-1;
    int lk=1,rk=1;
    bool f=false;
    rep(i,m){
        if(s[i]=='L'){
            if(l==0){
                if(l!=r) lk++;
            }
            else l--;

            if(r!=0) r--;
        }else{
            if(r==n-1){
                if(l!=r) rk++;
            }
            else r++;

            if(l!=n-1) l++;
        }
    }

    vector<ll> ans(n,0);
    int i;
    for(i=0;i<lk;i++) ans[l]+=a[i];
    for(int j=l+1;j<r;i++,j++) ans[j]+=a[i];
    for(;i<n;i++) ans[r]+=a[i];
    rep(i,n) cout<<ans[i]<<(i+1==n?"\n":" ");
    return 0;
}