Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Mini Metro

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn a simplified version of a "Mini Metro" game, there is only one subway line, and all the trains go in the same direction. There are $$$n$$$ stations on the line, $$$a_i$$$ people are waiting for the train at the $$$i$$$-th station at the beginning of the game. The game starts at the beginning of the $$$0$$$-th hour. At the end of each hour (couple minutes before the end of the hour), $$$b_i$$$ people instantly arrive to the $$$i$$$-th station. If at some moment, the number of people at the $$$i$$$-th station is larger than $$$c_i$$$, you lose.

A player has several trains which he can appoint to some hours. The capacity of each train is $$$k$$$ passengers. In the middle of the appointed hour, the train goes from the $$$1$$$-st to the $$$n$$$-th station, taking as many people at each station as it can accommodate. A train can not take people from the $$$i$$$-th station if there are people at the $$$i-1$$$-th station.

If multiple trains are appointed to the same hour, their capacities are being added up and they are moving together.

The player wants to stay in the game for $$$t$$$ hours. Determine the minimum number of trains he will need for it.

Input

The first line contains three integers $$$n$$$, $$$t$$$, and $$$k$$$ ($$$1 \leq n, t \leq 200, 1 \leq k \leq 10^9$$$) — the number of stations on the line, hours we want to survive, and capacity of each train respectively.

Each of the next $$$n$$$ lines contains three integers $$$a_i$$$, $$$b_i$$$, and $$$c_i$$$ ($$$0 \leq a_i, b_i \leq c_i \leq 10^9$$$) — number of people at the $$$i$$$-th station in the beginning of the game, number of people arriving to $$$i$$$-th station in the end of each hour and maximum number of people at the $$$i$$$-th station allowed respectively.

Output

Output a single integer number — the answer to the problem.

Examples

Input

3 3 10

2 4 10

3 3 9

4 2 8

Output

2

Input

4 10 5

1 1 1

1 0 1

0 5 8

2 7 100

Output

12

Note

Let's look at the sample. There are three stations, on the first, there are initially 2 people, 3 people on the second, and 4 people on the third. Maximal capacities of the stations are 10, 9, and 8 respectively.

One of the winning strategies is to appoint two trains to the first and the third hours. Then on the first hour, the train takes all of the people from the stations, and at the end of the hour, 4 people arrive at the first station, 3 on the second, and 2 on the third.

In the second hour there are no trains appointed, and at the end of it, the same amount of people are arriving again.

In the third hour, the train first takes 8 people from the first station, and when it arrives at the second station, it takes only 2 people because it can accommodate no more than 10 people. Then it passes by the third station because it is already full. After it, people arrive at the stations once more, and the game ends.

As there was no such moment when the number of people at a station exceeded maximal capacity, we won using two trains.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/02/2021 05:30:07 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|