#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
void fact_init(int n);
long long exp(long long taban, long long us, long long md);
long long ebob(long long a, long long b);
long long ekok(long long a, long long b);
long long komb(long long a, long long b);
vector<long long> fact;
vector<long long> inv_fact;
void fact_init(int n) {
  fact.resize(n + 5);
  inv_fact.resize(n + 5);
  fact[0] = inv_fact[0] = 1;
  for (int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    inv_fact[i] = exp(fact[i], mod - 2, mod);
  }
}
long long exp(long long taban, long long us, long long md) {
  long long carpan = taban % md;
  if (carpan == 0) return 0;
  long long temp = us;
  long long res = 1;
  while (temp) {
    if (temp % 2) res = (res * carpan) % md;
    temp /= 2;
    carpan = (carpan * carpan) % md;
  }
  return res;
}
long long ebob(long long a, long long b) {
  if (!a) return b;
  return ebob(b % a, a);
}
long long ekok(long long a, long long b) { return (a * b) / ebob(a, b); }
long long komb(long long a, long long b) {
  if (a < b) return 0;
  return fact[a] * (inv_fact[a - b] * inv_fact[b] % mod) % mod;
}
const int N = 1e5 + 5;
multiset<int> cs[N], ds[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, c, d;
  cin >> n >> c >> d;
  multiset<int> c_all, d_all;
  for (int i = 0; i < n; i++) {
    int beauty, price;
    char type;
    cin >> beauty >> price >> type;
    if (type == 'C') {
      if (price > c) continue;
      cs[price].insert(beauty);
    } else {
      if (price > d) continue;
      ds[price].insert(beauty);
    }
  }
  int res = 0;
  for (int i = c; i >= 0; i--) {
    if (i >= c - i) {
      for (auto x : cs[c - i]) c_all.insert(x);
    }
    if (cs[i].empty()) continue;
    auto it = cs[i].end();
    it--;
    if (i <= c - i) {
      c_all.erase(c_all.find(*it));
    }
    if (!c_all.empty()) res = max(res, *c_all.rbegin() + *it);
    if (i <= c - i) {
      for (auto eraser = cs[i].begin(); eraser != it; eraser++)
        c_all.erase(c_all.find(*eraser));
    }
  }
  for (int i = d; i >= 0; i--) {
    if (i >= d - i) {
      for (auto x : ds[d - i]) d_all.insert(x);
    }
    if (ds[i].empty()) continue;
    auto it = ds[i].end();
    it--;
    if (i <= d - i) d_all.erase(d_all.find(*it));
    if (!d_all.empty()) res = max(res, *d_all.rbegin() + *it);
    if (i <= d - i) {
      for (auto eraser = ds[i].begin(); eraser != it; eraser++)
        d_all.erase(d_all.find(*eraser));
    }
  }
  int sec[2] = {};
  for (int i = 0; i <= c; i++) {
    if (cs[i].empty()) continue;
    auto it = cs[i].end();
    it--;
    sec[0] = max(sec[0], *it);
  }
  for (int i = 0; i <= d; i++) {
    if (ds[i].empty()) continue;
    auto it = ds[i].end();
    it--;
    sec[1] = max(sec[1], *it);
  }
  if (sec[0] && sec[1]) res = max(res, sec[0] + sec[1]);
  cout << res << "\n";
}
