#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll N, M; scanf("%lld %lld", &N, &M);
	vector<ll> a(N); for (int i = 0; i < N; i++) scanf("%lld", &a[i]);
	string s; cin >> s;
	deque<ll> dq;
	for (int i = 0; i < N; i++) dq.push_back(a[i]);
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'L') {
			ll t1 = dq.front();
			dq.pop_front();
			ll t2 = dq.front();
			dq.pop_front();
			dq.push_front(t1 + t2);
			dq.push_back(0);
		}
		else {
			ll t1 = dq.back();
			dq.pop_back();
			ll t2 = dq.back();
			dq.pop_back();
			dq.push_back(t1 + t2);
			dq.push_front(0);
		}
	}
	for (int i = 0; i < N; i++) {
		cout << dq[i];
		if (i == N - 1) cout << "\n";
		else cout << " ";
	}
	return 0;
}