#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cout << a[i] << " "; cout << "\n"; }
template<class T> void verr(const vector<T>& v){ for(auto& a : v) cout << a << " "; cout << "\n"; }
ll dbgt = 1; void err() { cout << "passed " << dbgt++ << "\n"; }
template<class H, class... T> void err(H&& h,T&&... t){ cout<< h << (sizeof...(t)?" ":"\n"); if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
//--------------------------------------------------------------------------------//
ll A[200005];
int main() {
    init();
    ll N,M;
    cin >> N >> M;
    rep(i, N) cin >> A[i];
    string S;
    cin >> S;

    ll l = 0, r = N - 1, li = 0, ri = N - 1;
    rep(i,M){
        if(S[i]=='L'){
            if(l==0){
                li = min(N - 1, li + 1);
            }
            else{
                l--;
            }
            r = max(r - 1, 0ll);
        }else{
            if(r==N-1){
                ri = max(0ll, ri - 1);
            }
            else{
                r++;
            }
            l = min(l + 1, N - 1);
        }
    }

    vl ans;
    rep(i, l) ans.eb(0);
    ll sum = 0;
    rep(i, li + 1) sum += A[i];
    ans.eb(sum);
    // verr(ans);
    repe(i, li + 1, ri + 1) ans.eb(A[i]);

    repe(i, max(li,ri) + 1, N) ans.back() += A[i];
    repe(i, r + 1, N) ans.eb(0);

    // err(l, r, li, ri);
    rep(i, N) cout << ans[i] << " ";
    cout << endl;
}