#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;
    
    vector<int> count(n, 0);
    vector<int> ans(n, 0);
    int state;
    rep(i, 0, n){
        state = i;
        rep(j, 0, m){
            if(s[j] == 'L'){
                if(state == 0) continue;
                else state--;
            }
            else{
                if(state == n-1) continue;
                else state++;
            }
        }
        count[i] = state;
        //cout << count[i] << endl;
        ans[count[i]] += a[i];
    }
    
    rep(i, 0, n){
        cout << ans[i] << " ";
    }
    cout << endl;
    return 0;
}