#include using namespace std; using LL = long long int; #define incID(i, l, r) for(int i = (l) ; i < (r); ++i) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i) #define incII(i, l, r) for(int i = (l) ; i <= (r); ++i) #define decII(i, l, r) for(int i = (r) ; i >= (l); --i) #define inc(i, n) incID(i, 0, n) #define dec(i, n) decID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define FR front() #define BA back() #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() auto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); }; #define SI(v) static_cast(v.size()) #define RF(e, v) for(auto & e: v) #define until(e) while(! (e)) #define if_not(e) if(! (e)) #define ef else if #define UR assert(false) #define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__); void IN_() { }; template void IN_(T & a, U & ... b) { cin >> a; IN_(b ...); }; template void OUT(T && a) { cout << a << endl; } template void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); } // ---- ---- template istream & operator>>(istream & s, vector & v) { RF(e, v) { s >> e; } return s; } template ostream & operator<<(ostream & s, vector const & v) { inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; } return s; } int main() { IN(int, n, m); vector a(n), ans(n); cin >> a; IN(string, s); int l = 0, r = n - 1, p = 0; RF(e, s) { if(e == 'L') { l--; r--; p--; } if(e == 'R') { l++; r++; p++; } l = clamp(l, 0, n - 1); r = clamp(r, 0, n - 1); } inc(i, n) { if(i + p < l) { ans[l] += a[i]; } ef(i + p > r) { ans[r] += a[i]; } else { ans[i + p] += a[i]; } } OUT(ans); }