from collections import deque
def Map():
  return list(map(int,input().split()))

N,X,Y = Map()
x = 0
y = 0
Z = X + Y
C = [0 for i in range(N)]
ans = 0
for i in range(N):
  j = i % Z
  P,c = map(str,input().split())
  P = int(P)
  if c == 'A':
    C[j] += P
  else:
    C[j] -= P
    ans += P

C.sort()
if Z <= N:
  for i in range(X):
    ans += C.pop()
else:
  while len(C) > Y:
    c = C.pop()
    ans += c
  while len(C):
    if C[-1] > 0:
      ans += C.pop()
    else:
      break
print(ans)