# Proud Merchants 代码的设计实现

Problem Description
Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very proud even if their nation hasn’t been so wealthy any more.
The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.
If he had M units of money, what’s the maximum value iSea could get?

Input
There are several test cases in the input.

Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.
Then N lines follow, each line contains three numbers Pi, Qi and Vi (1 ≤ Pi ≤ Qi ≤ 100, 1 ≤ Vi ≤ 1000), their meaning is in the description.

The input terminates by end of file marker.

Output
For each test case, output one integer, indicating maximum value iSea could get.

Sample Input
2 10
10 15 10
5 10 5
3 10
5 10 5
3 5 6
2 7 3

Sample Output
5
11

• 写回答

#### 悬赏问题

• ¥15 虚拟机打包apk出现错误
• ¥30 最小化遗憾贪心算法上界
• ¥15 用visual studi code完成html页面
• ¥15 聚类分析或者python进行数据分析
• ¥15 逻辑谓词和消解原理的运用
• ¥15 三菱伺服电机按启动按钮有使能但不动作
• ¥15 js，页面2返回页面1时定位进入的设备
• ¥50 导入文件到网吧的电脑并且在重启之后不会被恢复
• ¥15 （希望可以解决问题）ma和mb文件无法正常打开，打开后是空白，但是有正常内存占用，但可以在打开Maya应用程序后打开场景ma和mb格式。
• ¥20 ML307A在使用AT命令连接EMQX平台的MQTT时被拒绝