#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
    ll n,m;
    cin >> n >> m;
    vector<ll>a(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    string s;
    cin >> s;
    ll l=0,left=0,right=n-1,r=n-1;
    for (ll i = 0; i < s.size(); i++)
    {
        if (s[i]=='L')
        {
            if (l==0)
            {
                left=min(left+1,n-1);
            }else{
                l--;
            }
            r=max(r-1,0LL);
        }else{
            if (r==n-1)
            {
                right=max(0LL,right-1);
            }else{
                r++;
            }
            l=min(n-1,l+1);
        }
    }
    vector<ll>b(n,0);
    ll now=0;
    for (ll i = 0; i < n; i++)
    {
        if (i<left)
        {
            now+=a[i];
        }else if (i==left)
        {
            now+=a[i];
            b[l]=now;
            now=0;
        }else if (i<right)
        {
            b[l+(i-left)]=a[i];
        }else{
            b[r]+=a[i];
        }
    }
    for (ll i = 0; i < b.size(); i++)
    {
        cout<< b[i] << ' ';
    }
    cout << endl;
}