Problem: In 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 ≤ n, t ≤ 200, 1 ≤ k ≤ 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 ≤ a_i, b_i ≤ c_i ≤ 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

<image>

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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline char gc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline long long read() {
  long long x = 0;
  char ch = getchar();
  bool positive = 1;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') positive = 0;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return positive ? x : -x;
}
inline void write(long long a) {
  if (a < 0) {
    a = -a;
    putchar('-');
  }
  if (a >= 10) write(a / 10);
  putchar('0' + a % 10);
}
inline void writeln(long long a) {
  write(a);
  puts("");
}
inline void wri(long long a) {
  write(a);
  putchar(' ');
}
const long long N = 205;
const long long inf = 1e18;
long long n, t, k, S[N], s[N], a[N], b[N], c[N], f[N][N][2], g[N][N][2];
long long dfs(long long m, long long n, long long id);
long long Dfs(long long m, long long n, long long id) {
  if (g[m][n][id] != -1) return g[m][n][id];
  long long sum = m * s[n - 1] + (id ? S[n - 1] : s[n - 1]), ans = -inf;
  if (dfs(m, n - 1, id) >= 0 && (m + 1) * b[n] + (id ? a[n] : 0) <= c[n] &&
      (sum + k - 1) / k * k <= m * s[n] + (id ? S[n] : s[n]))
    ans = m * s[n] + (id ? S[n] : s[n]) - (sum + k - 1) / k * k;
  for (long long i = 0; i < m; i++) {
    long long t = Dfs(i, n, id);
    if (t < 0) continue;
    if (t % k + (m - i) * b[n] > c[n]) continue;
    t += (m - i) * b[n];
    t = min(t, t - (t - c[n] + k - 1) / k * k);
    long long sum = (m - i) * s[n - 1];
    if (dfs(m - i - 1, n - 1, 0) >= 0 && (sum + k - 1) / k * k - sum <= t)
      ans = max(ans, t - ((sum + k - 1) / k * k - sum));
  }
  return g[m][n][id] = ans;
}
long long dfs(long long m, long long n, long long id) {
  if (m == 0 || n == 0) return id ? S[n] + s[n] : s[n];
  if (f[m][n][id] != -1) return f[m][n][id];
  long long ans = -inf;
  for (long long i = 1; i <= m; i++)
    if ((m - i + 1) * b[n] <= c[n]) {
      long long t = Dfs(i - 1, n, id);
      if (t < 0) continue;
      if (t % k + (m - i + 1) * b[n] > c[n]) continue;
      t += (m - i + 1) * b[n];
      ans = max(ans, dfs(m - i, n - 1, 0) +
                         min((long long)t, t - (t - c[n] + k - 1) / k * k));
    }
  long long zz = b[n] * m + (id ? a[n] : 0) + b[n];
  if (zz <= c[n]) ans = max(ans, dfs(m, n - 1, id) + zz);
  return f[m][n][id] = ans;
}
signed main() {
  memset(f, -1, sizeof(f));
  memset(g, -1, sizeof(g));
  n = read(), t = read(), k = read();
  long long yq = 0;
  for (long long i = 1; i <= n + 1; i++) {
    if (i <= n) {
      a[i] = read();
      b[i] = read();
      c[i] = read();
    } else {
      a[i] = 1e18;
      c[i] = 2e18;
      b[i] = 0;
    }
    a[i] -= b[i];
    S[i] = S[i - 1] + a[i] + b[i];
    s[i] = s[i - 1] + b[i];
    yq += a[i] + b[i] * (t + 1);
    assert(a[i] <= c[i] && b[i] <= c[i]);
  }
  assert((yq - dfs(t, n + 1, 1)) % k == 0);
  cout << (yq - dfs(t, n + 1, 1)) / k << endl;
}