#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n, m;std::cin >> n >> m;
  vll a(n);get(a);
  ll num = 0;
  ll MIN = 0, MAX = 0;
  string s;std::cin >> s;
  for(auto c:s){
    if(c=='L') num--;
    else num++;
    MIN = min(MIN, num);
    MAX = max(MAX, num);
  }
  MIN = max(-(n-1), MIN);
  MAX = min(n-1, MAX);
  num = min(n-1, max(-(n-1), num));

  ll l = abs(MIN);
  for(int i=0;i<l;i++) a[l]+=a[i], a[i]=0;
  ll r = n-1-MAX;
  for(int i=r+1;i<n;i++) a[r]+=a[i], a[i]=0;
  vll ans(n, 0);
  for(int i=0;i<n;i++){
    if(a[i]==0) continue;
    ans[i+num] = a[i];
  }
  print(ans);
}