#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  ll n, m;
  cin >> n >> m;
  vector<ll> a(n);
  REP(i, n) { cin >> a[i]; }
  ll l = 0, r = n - 1;
  string s;
  cin >> s;
  REP(i, m) {
    if (s[i] == 'L') {
      if (l < n - 1) {
        l++;
        r++;
      }
      if (1 <= l && l < n) {
        a[l] += a[l - 1];
        a[l - 1] = 0;
      }
    } else {
      if (r > 0) {
        l--;
        r--;
      }
      if (0 <= r && r < n - 1) {
        a[r] += a[r + 1];
        a[r + 1] = 0;
      }
    }
  }

  FOR(i, l, r + 1) { cout << (i < 0 || n <= i ? 0 : a[i]) << " \n"[i == r]; }
}