#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    deque<int> a(n);
    for (int i = 0; i < n; i++)cin >> a[i];
    string s;
    cin >> s;

    for (int i = 0; i < m; i++) {
        if (s[i] == 'L') {
            int x = a.front();
            a.pop_front();
            a.front() += x;
            a.push_back(0);
        } else {
            int x = a.back();
            a.pop_back();
            a.back() += x;
            a.push_front(0);
        }
    }

    for (int i = 0; i < n; i++) {
        if (i > 0)cout << " ";
        cout << a[i];
    }
    cout << endl;
    return 0;
}