#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define llong long long

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    string s;
    cin >> s;

    int leftpos = 0;
    int rightpos = n-1;
    int left = 0;
    int right = n -1;
    rep(i, s.length()) {
        if(s[i] == 'L') {
            if(leftpos == 0) {
                left = min(left+1, n-1);
            } else {
                leftpos -= 1;
            }
            rightpos = max(0, rightpos-1);
        } else {
            if(rightpos == n-1) {
                right = max(0, right-1);
            } else {
                rightpos += 1;
            }
            leftpos = min(n-1, leftpos+1);
        }
    }

    vector<int> result(n, 0);
    if(leftpos < rightpos) {
        rep(i, left+1) result[leftpos] += a[i];
        for(int i=left+1; i<right; i++) {
            result[leftpos+i-left] += a[i];
        }
        for(int i=right; i<n; i++) {
            result[rightpos] += a[i];
        }
    } else {
        rep(i, n) result[leftpos] += a[i];
    }
    rep(i, n) {
        cout << result[i];
        if(i < n-1) cout << " ";
    }
    cout << "\n";
}