#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using T=tuple<ll,ll,ll>;

void IO(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
}

int main(){
  IO();
  ll n,x,y;
  cin>>n>>x>>y;
  vector<ll> p(n);
  vector<char> c(n);
  for(ll i=0;i<n;i++){
    cin>>p[i]>>c[i];
  }
  if(n<=x+y){
    ll ans=0;
    for(ll i=0;i<n;i++){
      if(c[i]=='A'){
        if(x>0){
          x--;
          ans+=p[i];
        }
      }else{
        if(y>0){
          y--;
          ans+=p[i];
        }
      }
    }
    cout<<ans<<endl;
  }else{
    vector<ll> sum_a(x+y);
    vector<ll> sum_b(x+y);
    for(ll i=0;i<n;i++){
      if(c[i]=='A'){
        sum_a[i%(x+y)]+=p[i];
      }else{
        sum_b[i%(x+y)]+=p[i];
      }
    }
    vector<T> v;
    for(ll i=0;i<x+y;i++){
      v.emplace_back(sum_a[i],i,0);
      v.emplace_back(sum_b[i],i,1);
    }
    sort(v.rbegin(),v.rend());
    ll rx=x;
    ll ry=y;
    ll ans=0;
    set<ll> fin_idx,second_idx;
    for(ll i=0;i<(ll)v.size();i++){
      ll val=get<0>(v[i]);
      ll idx=get<1>(v[i]);
      ll t=get<2>(v[i]);
      if(fin_idx.find(idx)==fin_idx.end()){
        if(second_idx.find(idx)==second_idx.end()){
          if(t==0&&rx>0){
            rx--;
            fin_idx.insert(idx);
            ans+=val;
          }else if(t==1&&ry>0){
            ry--;
            fin_idx.insert(idx);
            ans+=val;
          }else{
            second_idx.insert(idx);
          }
        }else{
          if(t==0){
            ry--;
            fin_idx.insert(idx);
            second_idx.erase(idx);
            ans+=val;
          }else{
            rx--;
            fin_idx.insert(idx);
            second_idx.erase(idx);
            ans+=val;
          }
        }
      }
    }
    cout<<ans<<endl;
  }
}