#include using namespace std; using i64 = long long; #define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++) #define all(x) x.begin(),x.end() template static inline std::vector ndvec(size_t&& n, T val) noexcept { return std::vector(n, std::forward(val)); } template static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept { return std::vector(tail)...))>(n, ndvec(std::forward(tail)...)); } template struct chain { Cond cond; chain(Cond cond) : cond(cond) {} bool operator()(T& a, const T& b) const { if(cond(a, b)) { a = b; return true; } return false; } }; template chain make_chain(Cond cond) { return chain(cond); } int main() { i64 N, M; cin >> N >> M; vector A(N); rep(i,0,N) { cin >> A[i]; } string S; cin >> S; i64 L = 0; i64 R = N - 1; i64 ll = -1; i64 rr = N; for(auto c: S) { if(c == 'R') { L++; R++; if(L != R && R >= N) rr--; if(L >= N) L = N - 1; if(R >= N) R = N - 1; } else { L--; R--; if(L != R && L < 0) ll++; if(L < 0) L = 0; if(R < 0) R = 0; } } vector ans(N); rep(i,0,N) { if(i <= ll) ans[L] += A[i]; else if(rr <= i) ans[R] += A[i]; else ans[i] += A[i]; } rep(i,0,N) { cout << ans[i] << " \n"[i + 1 == N]; } }