#include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
  int n, m;
  cin >> n >> m;
  deque<ll> a;
  for(int i = 0; i < n; i++){
    int tmp;
    cin >> tmp;
    a.push_back(tmp);
  }
  string s;
  cin >> s;
  for(int i = 0; i < m; i++){
    int tmp = 0;
    if(s[i] == 'L'){
      tmp += a.front();
      a.pop_front();
      tmp += a.front();
      a.pop_front();
      a.push_front(tmp);
      a.push_back(0);
    }else{
      tmp += a.back();
      a.pop_back();
      tmp += a.back();
      a.pop_back();
      a.push_back(tmp);
      a.push_front(0);
    }
  }
  for(int i = 0; i < n; i++){
    cout << a.front() << " ";
    a.pop_front();
  }
  cout << endl;
  return 0;
}