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

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations

ipt = sys.stdin.readline

def iin():
    return int(ipt())
def lmin():
    return list(map(int,ipt().split()))

MOD = 998244353
#############################################################

N,K,T = lmin()
A = input().split()
B = lmin()
C = [(b,i) for i,b in enumerate(B)]
ans = []
for i in range(N):
    if A[i] == "A":
        if T - B[i] > 0:
            T2 = T-B[i]
            tmp = T2%(K*2)
            
            ans.append(min(tmp,2*K-tmp))
        else:
            
            ans.append(B[i] - T)
    else:
        if T - (K-B[i]) - K > 0:
            T2 = T - (K-B[i]) - K
            tmp = T2%(K*2)
            
            ans.append(min(tmp,2*K-tmp))
        else:
            
            ans.append(min(B[i] + T, 2*K-B[i]-T))

C.sort()
ans.sort()
ans2 = [0]*N
for i in range(N):
    ans2[C[i][1]] = ans[i]
print(*ans2)