import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

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)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

n,x,y=LI()
z=x+y
pp,cc=[],[]
for _ in range(n):
    p,c=SI().split()
    pp.append(int(p))
    cc.append(c=="B")

dd=[]
ans=0
for si in range(z):
    ss=[0,0]
    for i in range(si,n,z):
        p,c=pp[i],cc[i]
        ss[c]+=p
    ans+=ss[0]
    dd.append(ss[0]-ss[1])

dd.sort()
for j,d in enumerate(dd[:y]):
    if j>=n-x and d>=0:break
    ans-=d

print(ans)