#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N, M;
    cin >> N >> M;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    int l = 0, r = N - 1, ls = 0;
    string S;
    cin >> S;
    int cnt = 0;
    bool f = 0;
    ll left = 0, right = 0;
    vector<ll> res(N);

    rep(i, M) {
        if(S[i] == 'L') {
            cnt++;
            l = max(l, cnt);
            ls = max(0, ls - 1);
        } else if(S[i] == 'R') {
            cnt--;
            r = min(r, N + cnt - 1);
            ls = min(N - 1, ls + 1);
        }
        if(l == r)
            f = 1;
    }
    if(f) {
        ll sum = 0;
        rep(i, N) sum += A[i];
        res[ls] = sum;
    } else {
        for(int i = 0; i <= l; i++)
            left += A[i];
        for(int i = N - 1; i >= r; i--)
            right += A[i];
        res[ls] = left;
        for(int i = 1; l + i < r; i++) {
            res[ls + i] = A[l + i];
        }
        res[ls + r - l] = right;
    }
    rep(i, N) cout << res[i] << (i == N - 1 ? "\n" : " ");
}