#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    deque<int> que;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        que.push_back(a);
    }
    string s;
    cin >> s;
    for (int j = 0; j < m; j++) {
        if (s[j] == 'L') {
            int x = que.front();
            que.pop_front();
            int y = que.front();
            que.pop_front();
            que.push_front(x + y);
            que.push_back(0);
        }
        else {
            int x = que.back();
            que.pop_back();
            int y = que.back();
            que.pop_back();
            que.push_back(x + y);
            que.push_front(0);
        }
    }
    for (int i = 0; i < n; i++) {
        cout << que.front();
        que.pop_front();
        if (i != n - 1) {
            cout << " ";
        }
    }
    cout << endl;
    return 0;
}