#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;

typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = 1e9;
const long long INFL = 1LL<<60;

const int mod = 1000000007;


int main()
{
  int n, m;
  cin >> n >> m;
  deque<ll> q;
  rep(i, n) {
    ll tmp;
    cin >> tmp;
    q.push_back(tmp);
  }
  string s;
  cin >> s;
  rep(i, s.size()) {
    if (s[i] == 'L') {
      q.push_back(0);
      ll v = q.front();
      q.pop_front();
      q.front() += v;
    } else {
      q.push_front(0);
      ll v = q.back();
      q.pop_back();
      q.back() += v;
    }
  }
  rep(i, n) {
    cout << q[i];
    if (i != n-1) cout << " ";
  }
  cout << endl;
  return 0;
}