A - Vanya and Food Processor ACM

Vanya smashes potato in a vertical food processor. At each moment of time the height of the potato in the processor doesn’t exceed h and the processor smashes k centimeters of potato each second. If there are less than k centimeters remaining, than during this second processor smashes all the remaining potato.

Vanya has n pieces of potato, the height of the i-th piece is equal to ai. He puts them in the food processor one by one starting from the piece number 1 and finishing with piece number n. Formally, each second the following happens:

If there is at least one piece of potato remaining, Vanya puts them in the processor one by one, until there is not enough space for the next piece.Processor smashes k centimeters of potato (or just everything that is inside).

Provided the information about the parameter of the food processor and the size of each potato in a row, compute how long will it take for all the potato to become smashed.

Input

The first line of the input contains integers n, h and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ h ≤ 10的9次方) — the number of pieces of potato, the height of the food processor and the amount of potato being smashed each second, respectively.

The second line contains n integers ai (1 ≤ ai ≤ h) — the heights of the pieces.

Output

Print a single integer — the number of seconds required to smash all the potatoes following the process described in the problem statement.

Examples
Input

5 6 3
5 4 3 2 1

Output

5

Input

5 6 3
5 5 5 5 5

Output

10

Input

5 6 3
1 2 1 1 1

Output

2

Note

Consider the first sample.

First Vanya puts the piece of potato of height 5 into processor. At the end of the second there is only amount of height 2 remaining inside.
Now Vanya puts the piece of potato of height 4. At the end of the second there is amount of height 3 remaining.
Vanya puts the piece of height 3 inside and again there are only 3 centimeters remaining at the end of this second.
Vanya finally puts the pieces of height 2 and 1 inside. At the end of the second the height of potato in the processor is equal to 3.
During this second processor finally smashes all the remaining potato and the process finishes.

In the second sample, Vanya puts the piece of height 5 inside and waits for 2 seconds while it is completely smashed. Then he repeats the same process for 4 other pieces. The total time is equal to 2·5 = 10 seconds.

In the third sample, Vanya simply puts all the potato inside the processor and waits 2 seconds.

题目大概意思是： n个土豆，不能高于h，一次可以处理k高度。土豆要按顺序处理。

解题思路： 注意要用long long，如果不够高就往上加土豆，如果高于h就把前面的土豆处理了再放土豆。最后剩下的土豆不够k也要处理。

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	long long int n,h,k,i,sum=0,num=0;
	cin>>n>>h>>k;
	long long int a[n];
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	for(i=0;i<n;i++)
	{
		sum+=a[i];//叠加到能处理的高度 
		if(a[i]>h)//不知道这个有没有测试点，高于h的土豆无法处理
		{
			a[i]=0;
		}
		if(sum>h)//如果加进去的土豆高了，就先把之前剩的处理完 
		{
			num++;//num++的前提是处理的土豆都不高于k
			sum=a[i];//处理完后放入新土豆
		}
		if(sum>=k)//保证土豆不会搞过k，如果高了就处理 
		{//确保了整局基本没有高于k的土豆，如果有就是新加的那个本来就大于k
			num+=sum/k;//这里保证了如果是k的倍数也可以加，前提是小于h
			sum=sum%k;//剩下的土豆高度
		}
		if(i==n-1&&sum>0)//最后检查剩下的土豆
		{
			num++;//确保每次剩的土豆不高于k
		}
	}
	cout<<num<<endl;
	return 0;
}