#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  deque<int> a;
  REP(_, n) {
    int ai; cin >> ai;
    a.emplace_back(ai);
  }
  int l = 0, r = n - 1;
  string s; cin >> s;
  for (char c : s) {
    if (c == 'L') {
      if (l == 0) {
        if (r > 0) {
          int tmp = a.front();
          a.pop_front();
          int fro = a.front();
          a.pop_front();
          a.emplace_front(tmp + fro);
          --r;
        }
      } else {
        --l;
        --r;
      }
    } else if (c == 'R') {
      if (r == n - 1) {
        if (l < n - 1) {
          int tmp = a.back();
          a.pop_back();
          int bac = a.back();
          a.pop_back();
          a.emplace_back(tmp + bac);
          ++l;
        }
      } else {
        ++l;
        ++r;
      }
    }
    // cout << l << ' ' << r << endl;
  }
  // cout << a.size() << ' ' << l << ' ' << r << endl;
  vector<int> ans(n, 0);
  for (int i = r; i >= l; --i) {
    ans[i] = a.back();
    a.pop_back();
  }
  REP(i, n) cout << ans[i] << " \n"[i + 1 == n];
  return 0;
}