#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct stone {
  int type;
  int weight;
  int value;
};
int knapsack(const vector<stone>& stones, int c) {
  int n = stones.size();
  vector<int> dp(c + 1, 0);
  for (int i = 0; i < n; ++i) {
    int w = stones[i].weight;
    int v = stones[i].value;
    for (int j = c; j >= w; --j) {
      dp[j] = max(dp[j], dp[j - w] + v);
    }
  }
  return dp[c];
}
int main() {
  int n, w, d;
  cin >> n >> w >> d;
  vector<stone> stones(n);
  for (int i = 0; i < n; ++i) {
    cin >> stones[i].type >> stones[i].weight >> stones[i].value;
  }
  vector<stone> t_0, t_1;
  for (const stone& stone : stones) {
    if (stone.type == 0) {
      t_0.push_back(stone);
    } else {
      t_1.push_back(stone);
    }
  }
  int v1 = knapsack(t_0, w);
  int v2 = knapsack(t_1, w - d);
  int m_v = max(v1 + v2, v1 + knapsack(t_1, w));
  cout << m_v << endl;
  return 0;
}