#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	string S;
	cin >> S;
	int mn = 0, mx = 0, sum = 0, pos = 0;
	REP(i, M) {
		const int m = S[i] == 'R' ? 1 : -1;
		pos += m;
		chmax(pos, 0);
		chmin(pos, N - 1);
		
		sum += m;
		chmin(mn, sum);
		chmax(mx, sum);
	}
	chmax(mn, -N + 1);
	chmin(mx, N - 1);
	const int l = -mn, r = N - 1 - mx; // [0, l) -> l, (r, N) -> r
	
	vector<int> ans(N);
	if (l >= r) ans[pos] = accumulate(ALL(A), 0);
	else {
		REP(i, l) ans[pos] += A[i];
		FOR(i, l, r) ans[pos + i - l] += A[i];
		FOR(i, r, N) ans[pos + r - l] += A[i];
	}
	REP(i, N) printf("%d%c", ans[i], " \n"[i + 1 == N]);
}