#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(n) begin(n), end(n)
using ll = long long;
using namespace std;

int main(){
	int n, m;
	cin >> n >> m;
	list<ll> lis;
	rep(i, n){
		ll in;
		cin >> in;
		lis.push_back(in);
	}
	string s;
	cin >> s;
	rep(i, m){
		if(s[i] == 'L'){
			ll l1 = lis.front();
			lis.pop_front();
			lis.front() += l1;
			lis.push_back(0);
		}else{
			ll l1 = lis.back();
			lis.pop_back();
			lis.back() += l1;
			lis.push_front(0);
		}
	}
	rep(i, n){
		if(i != 0) cout << " ";
		cout << lis.front();
		lis.pop_front();
	}
	cout << endl;
	return 0;
}