CF709A.Juicer

Kolya is going to make fresh orange juice. He has n oranges of sizes _a_1, _a_2, ..., a__n. Kolya will put them in the juicer in the fixed order, starting with orange of size _a_1, then orange of size _a_2 and so on. To be put in the juicer the orange must have size not exceeding b, so if Kolya sees an orange that is strictly greater he throws it away and continues with the next one.

The juicer has a special section to collect waste. It overflows if Kolya squeezes oranges of the total size strictly greater than d. When it happens Kolya empties the waste section (even if there are no more oranges) and continues to squeeze the juice. How many times will he have to empty the waste section?

科里亚打算制作新鲜的橙汁。他有 $n$ 个橙子，大小分别为 $a_1, a_2, \dots, a_n$。科里亚将按固定顺序将这些橙子依次放入榨汁机中，即先放大小为 $a_1$ 的橙子，再放大小为 $a_2$ 的橙子，依此类推。要放入榨汁机，橙子的大小不能超过 $b$；因此，若科里亚遇到一个严格大于 $b$ 的橙子，他就将其丢弃，并继续处理下一个橙子。

榨汁机有一个专门收集废料的区域。当科里亚所挤压的橙子的总大小严格超过 $d$ 时，该废料区就会溢出。此时，科里亚必须清空废料区（即使之后已无橙子可处理），然后继续榨汁。问：科里亚总共需要清空废料区多少次？

The first line of the input contains three integers n, b and d (1 ≤ n ≤ 100 000, 1 ≤ b ≤ d ≤ 1 000 000) — the number of oranges, the maximum size of the orange that fits in the juicer and the value d, which determines the condition when the waste section should be emptied.

The second line contains n integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 1 000 000) — sizes of the oranges listed in the order Kolya is going to try to put them in the juicer.

输入的第一行包含三个整数 $n$、$b$ 和 $d$（$1 ≤ n ≤ 100\,000$，$1 ≤ b ≤ d ≤ 1\,000\,000$）——分别表示橙子的数量、能放入榨汁机的最大橙子尺寸，以及决定何时清空废料区的参数 $d$。

第二行包含 $n$ 个整数 $a_1,\,a_2,\,...,\,a_n$（$1 ≤ a_i ≤ 1\,000\,000$）——表示 Kolya 将按此顺序尝试放入榨汁机的橙子尺寸。

Print one integer — the number of times Kolya will have to empty the waste section.

输出一个整数——Kolya 需要清空废料区的次数。

In the first sample, Kolya will squeeze the juice from two oranges and empty the waste section afterwards.

In the second sample, the orange won't fit in the juicer so Kolya will have no juice at all.

在第一个样例中，科里亚将从两个橙子中榨汁，并在之后清空废料槽。

在第二个样例中，橙子无法放入榨汁机，因此科里亚完全无法榨出果汁。