#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,K,Q,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
const ll INF = 1LL<<60;
typedef pair<ll, ll> P;

int main() {
    cin>>N>>M;
    vec a(N);
    rep(i,N) cin>>a[i];
    cin>>S;
    ll l = 0, r = N - 1, ml = 0, mr = 0, total = 0;
    rep(i,M){
        if(S[i] == 'L'){
            --total;
            l = max(0LL, l - 1);
            r = max(0LL, r - 1);
        }else{
            ++total;
            l = min(N - 1, l + 1);
            r = min(N - 1, r + 1);
        }
        ml = min(ml, total);
        mr = max(mr, total);
    }
    int id = l;
    vec ans(N, 0);
    //cout<<l<<' '<<r<<' '<<ml<<' '<<mr<<' '<<total<<endl;
    if(mr - ml >= N) {
        ans[l] = accumulate(ALL(a), 0);
    }else{
        rep(i, -ml) ans[l] += a[i];
        reps(i, N - mr, N) ans[r] += a[i];
        int id = -ml;
        reps(i, l, r + 1) ans[i] += a[id++];
    }
    rep(i,N){
        cout<<ans[i];
        (i != N - 1 ? cout<<' ' : cout<<endl);
    }
}