#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=998244353;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};



int main(){
    int n,m;cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    string s;cin >> s;
    int t = 0,now = 0;
    int L = 0,R = 0;
    for (int i = 0; i < m; i++) {
        if(s[i] == 'L'){
            t--;
            now--;
            chmax(now, 0);
            chmax(t, -n);
        }
        else{
            t++;
            now++;
            chmin(now, n-1);
            chmin(t, n);
        }
        chmin(L,t);
        chmax(R,t);
    }
    L = abs(L);
    vector<int> ans(n,0);
    if(L + R < n){
        int ll = 0,rr = 0;
        for (int i = 0; i <= L; i++) {
            ll += a[i];
        }
        for (int i = n-R-1; i < n; i++) {
            rr += a[i];
        }
        ans[L+t] = ll;
        for (int i = L+t+1; i < n-R+t; i++) {
            ans[i] = a[L + i - (L + t + 1) + 1];
        }
        ans[n-R-1+t] = rr;
    }
    else{
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum += a[i];
        }
        ans[now] = sum;
    }
    for (int i = 0; i < n; i++) {
        cout << ans[i] << (i == n-1 ? "\n" : " ");
    }
    return 0;
}