#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define SZ(x) ((int)x.size())
#define fi first
#define se second
const int INF = 1e15;
using namespace std;

template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class T>
inline bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>
inline bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);

    int N,M; cin >> N >> M;
    int pos=0;
    int size=N;
    int l=0,r=0;
    int A[N];
    rep(i,N) cin >> A[i];
    string S; cin >> S;
    rep(i,M){
        if(S[i]=='L'){
            if(pos!=0) pos--;
            else {
                l++;
                if(size!=1) size--;
            }
        } else {
            if(pos+size==N) {
                r++;
                if(size!=1) size--;
            }
            if(pos!=N-1) pos++;
        }
    }
    vi v;

    if(size!=1){
        rep(i,l){
            A[i+1]+=A[i];
            A[i]=0;
        }
        rep(i,r){
            A[N-i-2]+=A[N-i-1];
            A[N-i-1];
        }
        rng(i,l,l+size){
            v.eb(A[i]);
        }
    }
    else {
        int sum=0;
        rep(i,N) sum+=A[i];
        v.eb(sum);
    }
    
   
    int t=0;
    while(t!=pos){
        cout << 0 << " ";
        t++;
    }
    rep(i,size){
        cout << v[i] << " ";
        t++;
    }
    while(t!=N){
        cout << 0 << " ";
        t++;
    }
    cout << "\n";
}