#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N, X, Y;
    cin >> N >> X >> Y;
    assert(N >= 1 && N <= 200000);
    assert(X >= 0 && X <= 200000);
    assert(Y >= 0 && Y <= 200000);
    assert(X + Y >= 1);
    vector<long long> P(N);
    vector<char> c(N);
    long long all_people = 0;
    for (int i = 0; i < N; i++) {
        cin >> P[i] >> c[i];
        assert(P[i] >= 1 && P[i] <= 1000000000);
        assert(c[i] == 'A' || c[i] == 'B');
        all_people += P[i];
    }
    vector<long long> groups(X + Y, 0);
    for (int i = 0; i < N; i++) {
        if (c[i] == 'A') {
            groups[i % (X + Y)] += P[i];
        } else {
            groups[i % (X + Y)] -= P[i];
        }
    }
    sort(groups.begin(), groups.end());
    long long ans = 0;
    for (int i = 0; i < Y; i++) {
        ans -= groups[i];
    }
    for (int i = Y; i < X + Y; i++) {
        ans += groups[i];
    }
    cout << (ans + all_people) / 2 << endl;
}