import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

def ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans

def ValueToArray10(x, digit):
    ans = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        ans[digit-i-1] = now%10
        now = now //10
    return ans
'''
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 2
N = 10 ** 6 + 2
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

'''

#a = list(map(int, input().split()))

#################################################
#################################################
#################################################
#################################################



n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
s = input()

le,ri = 0,n-1
lec,ric = 0,0
for i in range(m):
    if(s[i]=='L'):
        if(le==0):
            lec+=1
        le = max(0,le-1)
        ri = max(0,ri-1)
    else:
        if(ri==n-1):
            ric+=1
        le = min(n-1,le+1)
        ri = min(n-1,ri+1)

b = []
for i in range(le):
    b.append(0)
b.append(sum(a[0:lec+1]))
for j in range(max(0,ri-le-1)):
    b.append(a[le+1+j])
aa = a[::-1]
#print(aa)
b.append(sum(aa[0:ric+1]))
for i in range(n-len(b)):
    b.append(0)

print(' '.join(map(str,b)))