#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, x, y; cin >> n >> x >> y;
	vector<long long>a(x + y), b(x + y);
	rep(i, n) {
		int p; cin >> p;
		char c; cin >> c;
		if ('A' == c) a[i % (x + y)] += p;
		else b[i % (x + y)] += p;
	}
	long long ans = 0;
	vector<long long>da, db;
	rep(i, x + y) {
		ans += min(a[i], b[i]);
		if (a[i] > b[i]) {
			da.push_back(a[i] - b[i]);
			db.push_back(0);
		}
		else {
			db.push_back(b[i] - a[i]);
			da.push_back(0);
		}
	}
	sort(allR(da));
	sort(allR(db));
	rep(i, x)ans += da[i];
	rep(i, y)ans += db[i];
	cout << ans << endl;
	return 0;
}