#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,x,y; cin >> n >> x >> y;
    int m = x+y;
    ll res = 0;
    vector<int> p(n);
    vector<char> c(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i] >> c[i];
    }
    vector<pair<ll,int>> v;
    for (int i = 0; i < m; i += 1) {
        ll a = 0, b = 0;
        for (int j = i; j < n; j += m) {
            if (c[j] == 'A') {
                a += p[j];
            }
            else {
                b += p[j];
            }
        }
        if (a == b) {
            res += a;
        }
        else if (a > b) {
            res += b;
            v.push_back({a-b, 1});
        }
        else {
            res += a;
            v.push_back({b-a, 2});
        }
    }
    sort(v.rbegin(), v.rend());
    for (int i = 0; i < v.size(); ++i) {
        if (v[i].second == 1) {
            if (x) {
                x -= 1;
                res += v[i].first;
            }
        }
        else {
            if (y) {
                y -= 1;
                res += v[i].first;
            }
        }
    }
    cout << res << endl;
}