#ifdef Kaushal_26
        #include <debug.h>
#else
        #include <bits/stdc++.h>

        using namespace std;

        #define clog                    if (0) cerr
        #define lvl(...)                42
        #define dbg(...)                42
#endif

#define int                             long long

#define overload5(a, b, c, d, e, ...)   e
#define FORS(i, a, b, c)                for(int i = (a); i < (int)(b); i += c)
#define FOR1(i, a, b)                   for(int i = (a); i < (int)(b); ++i)
#define F0R(i, a)                       for(int i = (0); i < (int)(a); ++i)
#define ROFS(i, a, b, c)                for(int i = (b) - 1; i >= (int)(a); i -= c)
#define ROF1(i, a, b)                   for(int i = (b) - 1; i >= (int)(a); --i)
#define R0F(i, a)                       for(int i = (a) - 1; i >= (int)(0); --i)
#define FOR(...)                        overload5(__VA_ARGS__, FORS, FOR1, F0R)(__VA_ARGS__)
#define ROF(...)                        overload5(__VA_ARGS__, ROFS, ROF1, R0F)(__VA_ARGS__)
#define REP(i, x)			for(auto &i : x)

template <class T> auto V(const T& value, int size) {
        return vector<T>(size, value);
}

template <class T, class... D> auto V(const T& value, int size, D... w) {
        auto W = V(value, w...);
        return vector<decltype(W)>(size, W);
}

template <class T> bool ckmin(T &a, const T b) {
        return b < a ? a = b, 1 : 0;
}

template<class T> bool ckmax(T &a, const T b) {
        return b > a ? a = b, 1 : 0;
}

void solve() {
        int N, X, Y; cin >> N >> X >> Y;

        int M = X + Y;

        int a[N], b[N];
        FOR(i, N) {
                cin >> a[i];
                char c; cin >> c;
                b[i] = c - 'A';
        }

        auto dp = V<array<int, 2>>({0, 0}, M);
        FOR(i, N) dp[i % M][b[i]] += a[i];
        
        ranges::sort(dp, [&](auto P, auto Q) {
                if(P[0] - P[1] > Q[0] - Q[1]) return 1;
                return 0;
        });
        
        // FOR(i, M) cout << dp[i][0] << " " << dp[i][1] << endl;

        int ret = 0, cur = -1;
        FOR(i, min(M, X)) {
                ret += dp[i][0];
                cur = i;
        }
        ROF(i, M) {
                if(Y == 0) break;
                if(i == cur) break;
                Y--;
                ret += dp[i][1];
        }

        cout << ret << "\n";
}       

signed main() {
        cin.tie(0)->sync_with_stdio(0);

        #ifdef Kaushal_26
                for(int TestCase = 1; ; TestCase++) {
                        clog << endl; dbg(TestCase);
                        solve();
                }
        #else
                solve();
        #endif
        return 0;
}

// 1.77245