Problem:
Score : 300 points

Problem Statement

There are N boxes arranged in a row.
Initially, the i-th box from the left contains a_i candies.

Snuke can perform the following operation any number of times:

Choose a box containing at least one candy, and eat one of the candies in the chosen box.

His objective is as follows:

Any two neighboring boxes contain at most x candies in total.

Find the minimum number of operations required to achieve the objective.

Constraints

2 ≤ N ≤ 10^5

0 ≤ a_i ≤ 10^9

0 ≤ x ≤ 10^9

Input

The input is given from Standard Input in the following format:

N x
a_1 a_2 ... a_N

Output

Print the minimum number of operations required to achieve the objective.

Sample Input 1

3 3
2 2 2

Sample Output 1

1

Eat one candy in the second box.
Then, the number of candies in each box becomes (2, 1, 2).

Sample Input 2

6 1
1 6 1 2 0 4

Sample Output 2

11

For example, eat six candies in the second box, two in the fourth box, and three in the sixth box.
Then, the number of candies in each box becomes (1, 0, 1, 0, 0, 1).

Sample Input 3

5 9
3 1 4 1 5

Sample Output 3

0

The objective is already achieved without performing operations.

Sample Input 4

2 0
5 5

Sample Output 4

10

All the candies need to be eaten.

Solution in Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

program taskJ;
var n,x,i,j,sum,sum2:longint;
    o:array[1..100000]of longint;
begin
readln(n,x);
read(o[1]);
for i:=2 to n do
begin
  read(o[i]);
  if o[i]+o[i-1]>x then
    begin
    sum:=sum+o[i]+o[i-1]-x;
    o[i]:=o[i]-(o[i]+o[i-1]-x);
    end;
end;
for j:=n downto 2 do
begin
  if o[j]+o[j-1]>x then
  begin
    sum:=sum+o[j]+o[j-1]-x;
    o[j-1]:=o[j-1]-(o[j]+o[j-1]-x);
  end;
end;
if sum<sum2 then
writeln(sum2)
else
writeln(sum);
end.