#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    string s;
    cin >> s;

    int l = 0;
    for (int j = 0; j < m; j++) {
        if (s[j] == 'L') {
            if (l >= 0 && l + 1 < n) a[l + 1] += a[l], a[l] = 0;
            if (l + 1 < n) l++;
        } else {
            int r = l + n - 1;
            if (r < n && r - 1 >= 0) a[r - 1] += a[r], a[r] = 0;
            if (r - 1 >= 0) l--;
        }
    }

    for (int i = 0; i < n; i++) {
        int k = l + i;
        cout << ((0 <= k && k < n) ? a[k] : 0) << " \n"[i == n - 1];
    }

    return 0;
}