#include<bits/stdc++.h> using namespace std; //* ATCODER #include<atcoder/all> using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include<boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) template <typename T> bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template <typename T> bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template <typename T> T max(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template <typename T> T min(vector<T> &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template <typename T> T sum(vector<T> &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ int n, x, y; cin >> n >> x >> y; vector<char> c(n); vector<ll> p(n); rep(i,0,n) cin >> p[i] >> c[i]; vector<ll> rui_a(x+y), rui_b(x+y); rep(i,0,n){ if (c[i] == 'A'){ rui_a[i%(x+y)] += p[i]; }else{ rui_b[i%(x+y)] += p[i]; } } vector<pair<ll,ll>> pr; rep(i,0,x+y){ pr.push_back(pair(rui_a[i] - rui_b[i], i)); } sort(pr.begin(), pr.end()); reverse(pr.begin(), pr.end()); ll ans = 0; rep(i,0,x){ ans += rui_a[pr[i].second]; } rep(i,0,y){ ans += rui_b[pr[i+x].second]; } cout << ans << '\n'; }