#pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n, m; cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    int l = 0, r = n - 1, szl = 1, szr = 1;
    while (m--) {
        char c; cin >> c;
        if (c == 'L') {
            if (!l) {
                if (l + 1 == r) szl += szr, szr = 0;
                else if (l != r) ++szl;
            }
            if (l) --l;
            if (r) --r;
        }
        else {
            if (r >= n - 1) {
                if (l + 1 == r) szr += szl, szl = 0;
                else if (l != r) ++szr;
            }
            if (l < n - 1) ++l;
            if (r < n - 1) ++r;
        }
    }
    int i = 0;
    vector<int> ans(n);
    for (; i < szl; ++i)
        ans[l] += a[i];
    for (; i < n - szr; ++i)
        ans[++l] = a[i];
    for (; i < n; ++i)
        ans[r] += a[i];
    for (auto p : ans) cout << p << ' '; cout << '\n';
}