n, m = map(int, input().split())
alst = list(map(int, input().split()))
s = input()
total = 0
max_pos = 0
min_pos = 0
pos_start = 0
pos_end = n - 1
for ss in s:
    if ss == "L":
        total -= 1
        min_pos = min(min_pos, total)
        pos_start = max(pos_start - 1, 0)
        pos_end = max(pos_end - 1, 0)
    else:
        total += 1
        max_pos = max(max_pos, total)
        pos_start = min(pos_start + 1, n - 1)
        pos_end = min(pos_end + 1, n - 1)
ans = [0 for _ in range(n)]
for i, num in enumerate(alst):
    pos = max(pos_start, i + total)
    pos = min(pos_end, pos)
    ans[pos] += num
print(*ans)