import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] dij = [(0, 1), (1, 0), (1, 1), (1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 n, m = LI() aa = LI() s = SI() pre = pos = 1 l, r = 0, n for c in s: if c == "L": if l == 0: pre += 1 l = max(0, l-1) r = max(1, r-1) else: if r == n: pos += 1 l = min(n-1, l+1) r = min(n, r+1) # print(l,r,pre,pos) ans = [0]*n if l+1 == r: pre = pos = n ans[l] = sum(aa[:pre]) for i in range(r-l-2): ans[l+1+i] = aa[pre+i] ans[r-1] = sum(aa[-pos:]) print(*ans)