#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<deque>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

signed main(){
	cout<<fixed<<setprecision(10);
	
	int now = 0;
	deque<int> a, ans;
	string S;
	
	int N, M;
	
	cin>>N>>M;
	
	a.resize(N);
	ans.resize(N);
	
	for(int i = 0; i < N; i++){
		cin>>a[i];
	}
	
	cin>>S;
	
	for(int i = 0; i < S.size(); i++){
		if(S[i] == 'L') {
			if(now == 0) {
				if(a.size() >= 2) {
					a[1] += a[0];
					a.pop_front();
				}
			} else {
				now--;
			}
		} else {
			if(now + a.size() == N) {
				if(a.size() >= 2) {
					a[a.size()-2] += a[a.size()-1];
					a.pop_back();
					// cout<<"a.size() "<<a.size()<<endl;
					now++;
				}
			} else {
				now++;
			}
		}
	}
	
	for(int i = 0; i < a.size(); i++){
		ans[i+now] = a[i];
	}
	
	for(int i = 0; i < N; i++){
		if(i) cout<<" ";
		cout<<ans[i];
	}
	cout<<endl;
	
	return 0;
}