#include using namespace std; #define rep(i,n) for(ll i=0;i<(n);++i) using ll = int_fast64_t; using pll = pair; constexpr ll INF = 1LL<<60; constexpr ll MOD = 1e9+7; template bool chmax(T &a,const T &b){if(a bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;} #if loc||local void dump(){cerr< void dump(T&& h, Ts&&... t){cerr<(t)...);} #else void dump(){} template void dump(T&& h, Ts&&... t){} #endif template istream &operator>>(istream&is,vector&v){for(auto &elemnt:v)is>>elemnt;return is;} template istream &operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} template ostream &operator<<(ostream& os,vectorconst& v){for(auto const& vi:v)os< ostream &operator<<(ostream& os,pairconst& p){os<vector vec(size_t a){return vector(a);} templateauto vec(size_t a, Ts... ts){return vector(ts...))>(a, vec(ts...));} signed main(){ int n,m; cin>>n>>m; vector a(n); string s; cin>>a>>s; deque deq; for(auto ai:a)deq.push_back(ai); for(auto c:s){ if(c=='L'){ deq.push_back(0); ll v = deq.front(); deq.pop_front(); v += deq.front(); deq.pop_front(); deq.push_front(v); } if(c=='R'){ deq.push_front(0); ll v = deq.back(); deq.pop_back(); v += deq.back(); deq.pop_back(); deq.push_back(v); } } while(!deq.empty()){ cout<< deq.front() <<(size(deq)!=1?" ":"\n"); deq.pop_front(); } }