#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll n, x, y; cin >> n >> x >> y;
    vector<ll> p(n);
    vector<char> c(n);
    rep(i, n) cin >> p[i] >> c[i];

    vector<vector<ll>> sum(x+y, vector<ll>(2, 0));
    rep(i, n){
        if(c[i]=='A') sum[i%(x+y)][0]+=p[i];
        else sum[i%(x+y)][1]+=p[i];
    }

    ll ans = 0;
    priority_queue<ll> PQ;
    rep(i, x+y){
        ans += sum[i][1];
        PQ.push(sum[i][0]-sum[i][1]);
    }
    rep(i, x){
        ans += PQ.top();
        PQ.pop();
    }
    cout << ans << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}