#include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(int)(n);i>0;i--) #define REP(i,a,b) for(int i=a;i 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; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout<> n >> m; vl a(n); rep (i, n) cin >> a[i]; string s; cin >> s; int l = 0, r = n - 1; int x = 1, y = n - 1; rep (i, m) { if (s[i] == 'L') { if (l > 0) { l--; r--; } else { r--; x++; } } else { if (r < n - 1) { l++; r++; } else { l++; y--; } } l = min(n - 1, max(0LL, l)); r = min(n - 1, max(0LL, r)); } vl ans(n); rep (i, n) { if (i < x) ans[l] += a[i]; else if (i >= y) ans[r] += a[i]; else { ans[l + i + 1 - x] += a[i]; } } rep (i, n) { cout << ans[i] << " "; } cout << endl; }