#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
  int n, m; cin >> n >> m;
  vector<ll> a(n);
  rep(i,n) cin >> a[i];
  string s; cin >> s;
  
  rep(i,m) {
    if (s[i] == 'L') {
      rep(j, n-1) {
        a[j] += a[j+1];
        a[j+1] = 0;
      }
    } else {
      rep(j, n-1) {
        a[n-1-j] += a[n-2-j];
        a[n-2-j] = 0;
      }
    }
  }
  rep(i,n) {
    cout << a[i];
    if (i!=n-1) cout << " "; 
    else cout << endl;
  }
}