#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;


signed main(){
	int N,M;
	cin >> N >> M;
	vector<int>a(N);
	REP(i,N){
		cin >> a[i];
	}
	string s;
	cin >> s;
	int leftRoom = 0,rightRoom = N - 1;
	int l = 0,r = 0;
	REP(i,s.size()){
		if(s[i] == 'L'){
			if(leftRoom){
				--leftRoom;
			}else if(l + r + 1 < N){
				++l;
			}
			if(rightRoom)--rightRoom;
		}else{
			if(rightRoom + 1 != N){
				++rightRoom;
			}else if(l + r + 1 < N){
				++r;
			}
			if(leftRoom + 1 != N)++leftRoom;
		}
	}
	vector<int>ans;
	REP(i,l)a[i + 1] += a[i],a[i] = 0;
	REP(i,r)a[N - i - 2] += a[N - i - 1],a[N - i - 1] = 0;
	REP(i,leftRoom)ans.emplace_back(0);
	FOR(i,leftRoom,rightRoom + 1)ans.emplace_back(a[l + i - leftRoom]);
	FOR(i,rightRoom + 1,N)ans.emplace_back(0);
	REP(i,ans.size())cout << ans[i] << " \n"[i+1 == ans.size()];
}