def bsearch(mn, mx, func):
    idx = (mx + mn)//2
    while mx-mn>1:
        if not func(idx):
            idx, mx = (idx + mn)//2, idx
            continue
        idx, mn = (idx + mx)//2, idx
    return idx

N, M = map(int, input().split())
A = list(map(int, input().split()))
S = input().strip()

def f(i):
    if i == 0:
        return 2
    elif i == N-1:
        return 1
    for c in S:
        if c == "R":
            i = min(i+1, N-1)
        else:
            i = max(i-1, 0)
        if i == 0:
            return 2
        if i == N-1:
            return 1
    return 0

def g(i):
    for c in S:
        if c == "R":
            i = min(i+1, N-1)
        else:
            i = max(i-1, 0)
    return i

#print(f(2))
u = bsearch(-1, N, lambda i : f(i) == 2)
v = bsearch(-1, N, lambda i : f(i) != 1)
s1, s2 = sum(A[:u+1]), sum(A[v+1:])
#print(s1, s2)
R = [0] * N
R[g(u)] = s1
R[g(v+1)] = s2
for i in range(g(u)+1, g(v+1)):
    R[i] = A[i]
print(*R)