#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int N,M;
void solve()
{
	cin >> N >> M;
	deque<int> Q;
	for(int i = 0;i < N;i++)
	{
		int a;
		cin >> a;
		Q.push_back(a);
	}
	string S;
	cin >> S;
	for(int i = 0;i < M;i++)
	{
		if(S[i] == 'L')
		{
			int l = Q.front();
			Q.pop_front();
			Q.front() += l;
			Q.push_back(0);
		}
		else
		{
			int r = Q.back();
			Q.pop_back();
			Q.back() += r;
			Q.push_front(0);
		}
	}
	for(int i = 0;i < N;i++) cout << Q[i] << (i+1 == N ? "\n":" ");
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}