#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define ln '\n'
constexpr long long MOD = 1000000007LL;
//constexpr long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull; 
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T, class U> inline bool chmax(T &a, U b) { if (a < b) { a = b; return true;} return false; }
template<class T, class U> inline bool chmin(T &a, U b) { if (a > b) { a = b; return true;} return false; }
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

int N,M;
string S;
ll A[202020];
bool f(int x) {
    rep(i,M) {
        if (x==0) return true;
        if (S[i]=='L') x--;
        else x = min(x+1,N-1);
    }
    if (x==0) return true;
    else return false;
}

bool g(int x) {
    rep(i,M) {
        if (x==N-1) return true;
        if (S[i]=='L') x = max(0,x-1);
        else x++;
    }
    if (x==N-1) return true;
    return false;
}
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> M;
    rep(i,N) cin >> A[i];
    cin >> S;

    int ok1 = 0;
    int ng1 = N;
    while (ng1 - ok1 > 1) {
        int mid = (ok1+ng1)/2;
        if (f(mid)) ok1 = mid;
        else ng1 = mid;
    }
    int ok2 = N-1;
    int ng2 = -1;
    while (ok2 - ng2 > 1) {
        int mid = (ok2+ng2)/2;
        if (g(mid)) ok2 = mid;
        else ng2 = mid;
    }
    int l = ok1;
    rep(i,M) {
        if (S[i]=='L') l = max(0,l-1);
        else l = min(N-1,l+1);
    }
    int r = ok2;
    rep(i,M) {
        if (S[i]=='L') r = max(0,r-1);
        else r = min(N-1,r+1);
    }
    vector<ll> ans(N);
    rep(i,N) {
        if (i <= ok1) ans[l] += A[i];
        else if (i >= ok2) ans[r] += A[i];
        else ans[l + i-ok1] += A[i];
    }

    rep(i,N) cout << ans[i] << " ";
    cout << ln; 
    
}