//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
//#define i_7 (ll)(1E9+7)
#define i_7 998244353
#define i_5 i_7-2

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
//template<class T>void max(T a,T b){if(a<b)return b;else return a;}
//template<class T>void min(T a,T b){if(a>b)return b;else return a;}
//template<class T>bool Max(T&a, T b){if(a < b){a = b;return 1;}return 0;}
//template<class T>bool Min(T&a, T b){if(a > b){a = b;return 1;}return 0;}

//////////////////////////

int main(){fastio
    ll n,m;cin>>n>>m;
    ll a[n];rep(i,0,n-1)cin>>a[i];
    string s;cin>>s;
    ll mi=0,ma=0;
    ll pos=0;
    rep(i,0,m-1){
        if(s[i]=='L'){
            pos--;
        }else{
            pos++;
        }
        if(pos>=n)pos=n-1;
        if(pos<=-n)pos=-(n-1);
        Max(ma,pos);
        Min(mi,pos);
    }
    ll c=-mi;
    rep(i,0,c-1){
        //if(i+1>=n)break;
        a[i+1]+=a[i];
        a[i]=0;
    }
    c=ma;
    for(ll i=n-1;i>=n-c;i--){
        //if(i-1<0)break;
        a[i-1]+=a[i];
        a[i]=0;
    }
    if(ma+(-mi)>=n-1){
        ll pos=0;
        rep(i,0,m-1){
            if(s[i]=='L'){
                pos--;
            }else{
                pos++;
            }
            if(pos>=n)pos=n-1;
            if(pos<0)pos=0;
        }
        ll sum=0;
        rep(i,0,n-1)sum+=a[i];
        rep(i,0,n-1){
            if(i==pos)cout<<sum<<" ";
            else cout<<0<<" ";
        }
        return 0;
    }
    if(pos>=0){
        rep(cnt,1,pos)cout<<0<<" ";
        rep(i,0,n-pos-1)cout<<a[i]<<" ";
    }else{
        pos*=-1;
        rep(i,pos,n-1)cout<<a[i]<<" ";
        rep(i,n,pos+n-1)cout<<0<<" ";
    }
    
    return 0;
}