#include <bits/stdc++.h>
using namespace std;
void getre() {
  int x = 0;
  printf("%d\n", 1 / x);
}
void gettle() {
  int res = 1;
  while (1) res <<= 1;
  printf("%d\n", res);
}
template <typename T, typename S>
inline bool upmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
inline bool upmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename N, typename PN>
inline N flo(N a, PN b) {
  return a >= 0 ? a / b : -((-a - 1) / b) - 1;
}
template <typename N, typename PN>
inline N cei(N a, PN b) {
  return a > 0 ? (a - 1) / b + 1 : -(-a / b);
}
template <typename N>
N gcd(N a, N b) {
  return b ? gcd(b, a % b) : a;
}
template <typename N>
inline int sgn(N a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
inline void gn(long long &x) {
  int sg = 1;
  char c;
  while (((c = getchar()) < '0' || c > '9') && c != '-')
    ;
  c == '-' ? (sg = -1, x = 0) : (x = c - '0');
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= sg;
}
inline void gn(int &x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(unsigned long long &x) {
  long long t;
  gn(t);
  x = t;
}
inline void gn(double &x) {
  double t;
  scanf("%lf", &t);
  x = t;
}
inline void gn(long double &x) {
  double t;
  scanf("%lf", &t);
  x = t;
}
inline void gs(char *s) { scanf("%s", s); }
inline void gc(char &c) {
  while ((c = getchar()) > 126 || c < 33)
    ;
}
inline void pc(char c) { putchar(c); }
inline long long sqr(long long a) { return a * a; }
inline double sqrf(double a) { return a * a; }
const int inf = 0x3f3f3f3f;
const double pi = 3.14159265358979323846264338327950288L;
const double eps = 1e-6;
int n, c, d;
struct node {
  int beau, cost;
  char typ;
  void read() {
    gn(beau);
    gn(cost);
    gc(typ);
  }
} a[111111];
vector<node> cc, dd;
const int N = 100005;
pair<int, int> ma[N], secma[N];
int work(vector<node> &a, int hav) {
  for (int i = (0), _ed = (N); i < _ed; i++)
    ma[i] = secma[i] = make_pair(-inf, -1);
  for (int i = (0), _ed = (((int)(a).size())); i < _ed; i++) {
    pair<int, int> x = make_pair(a[i].beau, i);
    int id = a[i].cost;
    if (x > ma[id]) {
      secma[id] = ma[id];
      ma[id] = x;
    } else if (x > secma[id]) {
      secma[id] = x;
    }
  }
  for (int i = (1), _ed = (N); i < _ed; i++) {
    pair<int, int> tmp[4];
    tmp[0] = secma[i];
    tmp[1] = ma[i];
    tmp[2] = secma[i - 1];
    tmp[3] = ma[i - 1];
    sort(tmp, tmp + 4);
    secma[i] = tmp[2];
    ma[i] = tmp[3];
  }
  int ret = 0;
  for (int i = (0), _ed = (((int)(a).size())); i < _ed; i++) {
    if (a[i].cost >= hav) continue;
    int res = hav - a[i].cost;
    int to = a[i].beau;
    if (i == ma[res].second)
      to += secma[res].first;
    else
      to += ma[res].first;
    upmax(ret, to);
  }
  return ret;
}
int maa = 0;
int main() {
  gn(n);
  gn(c);
  gn(d);
  for (int i = (1), _ed = (n + 1); i < _ed; i++) a[i].read();
  for (int i = (1), _ed = (n + 1); i < _ed; i++)
    if (a[i].typ == 'C')
      cc.push_back(a[i]);
    else
      dd.push_back(a[i]);
  upmax(maa, work(cc, c));
  upmax(maa, work(dd, d));
  int havc = -inf, havd = -inf;
  for (int i = (1), _ed = (n + 1); i < _ed; i++)
    if (a[i].typ == 'C' && a[i].cost <= c) upmax(havc, a[i].beau);
  for (int i = (1), _ed = (n + 1); i < _ed; i++)
    if (a[i].typ == 'D' && a[i].cost <= d) upmax(havd, a[i].beau);
  upmax(maa, havc + havd);
  printf("%d\n", maa);
  return 0;
}
