import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
6 1 2
1 A
2 B
3 B
3 A
2 B
1 A
9 100 0
1 B
2 B
3 B
4 B
5 B
6 B
7 B
8 B
9 B
8 2 2
1 B
9 A
7 A
7 B
5 A
8 B
4 B
8 A
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,X,Y=map(int, input().split())
  score=[[0]*3 for _ in range(X+Y)]
  for i in range(N):
    P,c=input().split()
    P=int(P)
    if c=='A':
      score[i%(X+Y)][0]+=P
      score[i%(X+Y)][1]+=P
    else:
      score[i%(X+Y)][0]-=P
      score[i%(X+Y)][2]+=P
  score.sort(key=lambda x: -x[0])
  ans=0
  for i in range(X+Y):
    if i<X:
      ans+=score[i][1]
    else:
      ans+=score[i][2]
  print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)