#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	deque<int> deq;
	REP(i, N) {
		int a;
		scanf("%d", &a);
		deq.emplace_back(a);
	}
	string S;
	cin >> S;
	
	for (char c : S) {
		if (c == 'R') {
			const int a = deq.back(); deq.pop_back();
			const int b = deq.back(); deq.pop_back();
			deq.emplace_back(a + b);
			deq.emplace_front(0);
		}
		else {
			const int a = deq.front(); deq.pop_front();
			const int b = deq.front(); deq.pop_front();
			deq.emplace_front(a + b);
			deq.emplace_back(0);
		}
	}
	
	REP(i, N) {
		const int a = deq.front(); deq.pop_front();
		printf("%d%c", a, " \n"[i + 1 == N]);
	}
}