#include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define MAX max<ll>
#define MIN min<ll>
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll devc(ll x, ll y) { return (x + y - 1) / y; }

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

    ll N, M;
    cin >> N >> M;
    vec A(N);
    rep(i, N) cin >> A[i];
    string S;
    cin >> S;

    vec state(M + 1);
    rep1(i, M) state[i] += state[i - 1] + (S[i - 1] == 'L' ? -1 : 1);
    ll f_state = state.back();
    vec ans(N);
    sort(ALL(state));
    rep(i, N){
        ll l = 0, r = 0;
        if(state[0] + i < 0) l = abs(state[0] + i);
        if(state.back() + i >= N) r = abs(state.back() + i - N + 1);
        ll now = i + f_state + l - r;
        chmin(now, N - 1), chmax(now, 0LL);
        ans[now] += A[i];
    }

    cout << ans[0];
    rep1(i, N - 1) cout << " " << ans[i];
    print("");

    return 0;
}