Problem Statement

There is a shop that offers rental rooms. In this shop, $1$ machine is installed per $1$ room.

There are $2$ types of machines, machine A and machine B: $X$ rooms have machine A installed, and $Y$ rooms have machine B installed.

It is known that $N$ groups of customers, customers $1, 2, \dots, N$, will come to the shop in this order. Customer $i$ consists of $P_i$ people and wants a room with machine $c_i$ installed.

When customers come, the shop shows them to a room as follows.

• If there are rooms with no customers, choose one of them and show all members of the arriving customer to that room.
• If there is no room without customers, make all members of the customer who was shown to a room earliest among the customers in the shop leave. Then show all members of the newly arrived customer to the room that the departed customer occupied.

Find the maximum number of people who can be shown to a room with the machine they want (note that this is not the maximum number of customer groups).

Customers never leave voluntarily unless the shop orders them to leave.

Constraints

• $N, X, Y, P_i$ are integers.
• $1 \leq N \leq 2 \times 10^5$
• $0 \leq X, Y \leq 2 \times 10^5$
• $X + Y \geq 1$
• $1 \leq P_i \leq 10^9$
• $c_i$ is A or B.

Input

The input is given from standard input in the following format.

$N$ $X$ $Y$
$P_1$ $c_1$
$P_2$ $c_2$
$\vdots$
$P_N$ $c_N$

Output

Print the answer.

Sample

6 1 2
1 A
2 B
3 B
3 A
2 B
1 A

11

9 100 0
1 B
2 B
3 B
4 B
5 B
6 B
7 B
8 B
9 B

0

8 2 2
1 B
9 A
7 A
7 B
5 A
8 B
4 B
8 A

27