#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;



int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    rep(i, 0, n){
        cin >> a[i];
    }
    string s;
    cin >> s;
    rep(j, 0, m){
        if(s[j] == 'L'){
            a[0] += a[1];
            rep(i, 1, n-1){
                a[i] = a[i+1];
            }
            a[n-1] = 0;
        }
        else{
            a[n-1] += a[n-2];
            for(int i = n-2; i >= 1; i--){
                a[i] = a[i-1];
            }
            a[0] = 0;
        }
    }
    rep(i, 0, n){
        cout << a[i] << " ";
    }
    cout << endl;
    return 0;
}