#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  string s;
  cin >> s;
  deque<int> que;
  for (int i = 0; i < n; ++i) {
    que.push_back(a[i]);
  }
  for (int i = 0; i < m; ++i) {
    int sum = 0;
    if (s[i] == 'L') {
      sum += que.front();
      que.pop_front();
      sum += que.front();
      que.pop_front();
      que.push_front(sum);
      que.push_back(0);
    } else {
      sum += que.back();
      que.pop_back();
      sum += que.back();
      que.pop_back();
      que.push_back(sum);
      que.push_front(0);
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << que.front() << (i == n - 1 ? '\n' : ' ');
    que.pop_front();
  }
  return 0;
}