#include<bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using mint=modint998244353;
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rrep(i,a,b) for(ll i=(ll)(a-1);i>=(ll)(b);i--)
#define MOD 998244353
//#define MOD 1000000007
#define INF 1e18
#define Pair pair<ll,ll>
//#define PI numbers::pi
//#define E numbers::e
template <typename T> bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};

int main(){
    ll n,x,y; cin >> n >> x >> y;
    vector<ll> p(n);
    vector<char> c(n);
    rep(i,0,n) cin >> p[i] >> c[i];
    vector<Pair> v(x+y,{0,0});
    rep(i,0,n){
        if(c[i]=='A') v[i%(x+y)].first+=p[i];
        else v[i%(x+y)].second+=p[i];
    }
    priority_queue<Pair> pque;
    rep(i,0,x+y) pque.push({v[i].second-v[i].first,i});
    vector<char> w(x+y,'A');
    rep(i,0,y){
        w[pque.top().second]='B';
        pque.pop();
    }
    ll ans=0;
    rep(i,0,x+y){
        if(w[i]=='A') ans+=v[i].first;
        else ans+=v[i].second;
    }
    cout << ans << endl;
}