#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n, x , y;
	cin >> n >> x >> y;
	int m = min(n, x + y);
	vector<long long> a(m);
	long long base = 0;
	rep(i, n){
		int p;
		cin >> p;
		char z;
		cin >> z;
		int j = i % m;
		if(z == 'A') a[j] += p;
		if(z == 'B'){
			a[j] -= p;
			base += p;
		}
	}
	sort(a.rbegin(), a.rend());
	vector<long long> s(m + 1);
	rep(i, m) s[i + 1] = s[i] + a[i];
	long long ans = 0;
	rep(na, x + 1){
		int nb = m - na;
		if(nb < 0 or nb > y) continue;
		long long res = base;
		res += s[na];
		ans = max(ans, res);
	}
	cout << ans << "\n";
//	cout << base << "\n";
//	cout << a;
	return 0;
}