#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
signed main(){
    ll n,m;cin>>n>>m;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    vector<ll>b(m);
    rep(i,m){
        char c;cin>>c;
        if(c=='L')b[i]=-1;
        else b[i]=1;
    }
    vector<ll>ans(n);
    ll cnt=0;
    ll L=0,R=n-1;
    rep(i,m){
        L+=b[i];
        R+=b[i];
        cnt+=b[i];
        if(R>n-1)R=n-1;
        if(L>n-1)L=n-1;
        if(R<0)R=0;
        if(L<0)L=0;
    }
    if(R==L){
        rep(i,n){
            ans[R]+=a[i];
        }
        rep(i,n){
            cout<<ans[i]<<' ';
        }
        cout<<endl;
        return 0;
    }
    ll l=0,r=n-1;
    while(r-l>1){
        ll mid=(r+l)/2;
        bool f=0;
        ll cnt=mid;
        rep(i,m){
            cnt+=b[i];
            if(cnt==0){
                f=1;
                break;
            }
            if(cnt==n-1){
                f=0;
                break;
            }
            if(cnt<0)cnt=0;
            if(cnt>=n)cnt=n-1;
        }
        if(f)l=mid;
        else{
            r=mid;
        }
    }
    ll LL=l;
    l=0,r=n-1;
    while(r-l>1){
        ll mid=(r+l)/2;
        bool f=0;
        ll cnt=mid;
        rep(i,m){
            cnt+=b[i];
            if(cnt==0){
                f=0;
                break;
            }
            if(cnt==n-1){
                f=1;
                break;
            }
            if(cnt<0)cnt=0;
            if(cnt>=n)cnt=n-1;
        }
        if(f)r=mid;
        else{
            l=mid;
        }
    }
    ll RR=r;
    //cout<<LL<<' '<<RR<<endl;
    rep(i,n){
        if(i<=LL){
            ans[L]+=a[i];
        }else if(i>=RR){
            ans[R]+=a[i];
        }else{
            ans[i+cnt]+=a[i];
        }
    }
    rep(i,n){
        cout<<ans[i]<<' ';
    }
    cout<<endl;
}