B"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: 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. The first line of the input contains integers n, h and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100 xe2 x80 x89000, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89h xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89h) -- the heights of the pieces. Print a single integer -- the number of seconds required to smash all the potatoes following the process described in the problem statement. Consider the first sample. 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 xc2 xb75 xe2 x80 x89= xe2 x80 x8910 seconds. In the third sample, Vanya simply puts all the potato inside the processor and waits 2 seconds. "...