// Problem: No.2623 Room Allocation
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2623
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include<bits/stdc++.h>
#define debug(x) cerr<<(#x)<<" "<<(x)<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe; 
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=5e5+9,INF=1e15;
ll n,X,Y,a[N][2],ans,b[N];
char typ[2];
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read(),X=read(),Y=read();
	rep(i,1,n){
		ll x=read();
		scanf("%s",typ);
		if(typ[0]=='A')a[i%(X+Y)][0]+=x;
		else a[i%(X+Y)][1]+=x;
	}
	//选出 X 个 A, Y 个 B，sum 最大
	rep(i,1,X+Y)b[i]=a[i-1][1]-a[i-1][0];
	sort(b+1,b+X+Y+1);
	rep(i,0,X+Y-1)ans+=a[i][0];
	reverse(b+1,b+X+Y+1);
	rep(i,1,Y)ans+=b[i];
	write(ans);
	return 0;
}