#include <iostream>
#include <queue>

using namespace std;
using LL = long long;
using ULL = unsigned long long;

int main() {
    int N, M;
    cin >> N >> M;

    deque<int> dq;
    int a;
    for (int i = 0; i < N; i++) {
        cin >> a;
        dq.push_back(a);
    }

    string S;
    cin >> S;
    for (int i = 0; i < M; i++) {
        if (S[i] == 'L') {
            int p = dq.front();
            dq.pop_front();
            dq.front() += p;
            dq.push_back(0);
        } else {
            int p = dq.back();
            dq.pop_back();
            dq.back() += p;
            dq.push_front(0);
        }
    }

    for (int i = 0; i < dq.size(); i++) {
        if (i > 0) cout << " ";
        cout << dq[i];
    }
    cout << endl;
}