#include using i32 = int_fast32_t; using i64 = int_fast64_t; using u32 = uint_fast32_t; using u64 = uint_fast64_t; using f64 = double; using f80 = long double; #define FOR(v, a, b) for(i64 v = (a); v < (b); ++v) #define FORE(v, a, b) for(i64 v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(i64 v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include #else #define dump(...) ((void)0) #endif using namespace std; template void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost< istream& operator>>(istream &is, vector &v){for(auto &a : v) is >> a; return is;} template void pout(const T &value){std::cout << value << "\n";} template void pout(const T &value, const Args&... args){std::cout << value << " ";pout(args...);} template bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template bool chmax(T &a, const U &b){return (a void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} template auto make_vector(int n, int m, const T &value){return vector>(n, vector(m, value));} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); cerr << fixed << setprecision(12); } }init; int main(){ int N, M; while(cin >> N >> M){ vector a(N); cin >> a; string S; cin >> S; int left = 0, right = N-1; for(auto c : S){ if(c == 'L'){ if(left >= 0 and left < N-1){ a[left+1] += a[left]; a[left] = 0; } left += 1; right += 1; }else{ if(right >= 1 and right < N){ a[right-1] += a[right]; a[right] = 0; } left -= 1; right -= 1; } } dump(a, left); vector ans(N); if(left >= N) left = N-1; REP(i,N){ if(left + i >= 0 and left + i < N) ans[i] = a[left + i]; } join(cout, ALL(ans)); } return 0; }