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 1
    for c in S:
        if c == "R":
            i = min(i+1, N-1)
        else:
            i = max(i-1, 0)
        if i == 0:
            return 1
    return 0

def f2(i):
    if 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 == 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

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