#include <bits/stdc++.h>
using namespace std;
long long inline gcd(long long x, long long y) {
  return !y ? (long long)abs(x) : gcd(y, x % y);
}
long long inline lcm(long long a, long long b) {
  return ((long long)abs((a / gcd(a, b)) * b));
}
double inline cartesian_dist(double x1, double y1, double x2, double y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
long long bigmod(long long b, long long p, long long m) {
  if (!p)
    return 1 % m;
  else if (p & 1)
    return (((b % m) + m) % m * bigmod(b, p - 1, m)) % m;
  else {
    long long ret = bigmod(b, p / 2, m);
    return (ret * ret) % m;
  }
}
long long inverse(long long a, long long m) { return bigmod(a, m - 2, m); }
long long extended(long long a, long long m) {
  long long oldr = a, r = m, oldans = 1, ans = 0, quotient;
  while (r) {
    quotient = oldr / r;
    oldr = oldr - r * quotient;
    swap(oldr, r);
    oldans = oldans - ans * quotient;
    swap(oldans, ans);
  }
  return ((oldans % m) + m) % m;
}
const double PI = acos(-1.0);
const double eps = 10E-12;
void solve(vector<pair<pair<int, int>, int> > &vec, int &ans, int &have) {
  if (vec.size()) {
    sort(vec.begin(), vec.end());
    int maxi = 0;
    for (int i = 0; i < vec.size(); i++) {
      maxi = max(maxi, vec[i].first.second);
      vec[i].second = maxi;
    }
    for (int i = vec.size() - 1; i > 0; i--) {
      int lo =
          upper_bound(vec.begin(), vec.end(),
                      make_pair(make_pair(have - vec[i].first.first, 10000000),
                                10000000)) -
          vec.begin() - 1;
      if (lo >= 0) {
        if (lo < i)
          ans = max(ans, vec[i].first.second + vec[lo].second);
        else
          ans = max(ans, vec[i].first.second + vec[i - 1].second);
      }
    }
  }
}
int main() {
  int n, c, d, beauty, price, max1 = -1, max2 = -1;
  scanf("%d %d %d", &n, &c, &d);
  char s[5];
  vector<pair<pair<int, int>, int> > vecc, vecd;
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &beauty, &price);
    scanf("%s", s);
    if (s[0] == 'C' && price <= c) {
      max1 = max(beauty, max1);
      vecc.push_back(make_pair(make_pair(price, beauty), -1));
    }
    if (s[0] == 'D' && price <= d) {
      max2 = max(beauty, max2);
      vecd.push_back(make_pair(make_pair(price, beauty), -1));
    }
  }
  int ans = 0;
  if (max1 != -1 && max2 != -1) ans = max(ans, max1 + max2);
  solve(vecc, ans, c);
  solve(vecd, ans, d);
  printf("%d", ans);
  printf("\n");
  return 0;
}
