#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<'\n'


int main(){
    int n,m;
    cin >> n >> m;
    int t;deque<int> deq;
    REP(i,n){
        cin >> t;
        deq.push_back(t);
    }
    string s;cin >> s;
    int num1,num2;
    for(char i:s){
        if(i=='L'){
            deq.push_back(0);
            num1 = deq.front();
            deq.pop_front();
            num2 = deq.front();
            deq.pop_front();
            deq.push_front(num1+num2);
        }
        else{
            deq.push_front(0);
            num1 = deq.back();
            deq.pop_back();
            num2 = deq.back();
            deq.pop_back();
            deq.push_back(num1+num2);
        }
    }
    REP(i,n){
        if(i==n-1)cout << deq[i];
        else cout << deq[i] << " ";
    }
    cout << endl;
    return 0;
}