codeforces978E Bus Video System

The busses in Berland are equipped with a video surveillance system. The system records information about changes in the number of passengers in a bus after stops.

If $x$ is the number of passengers in a bus just before the current bus stop and $y$ is the number of passengers in the bus just after current bus stop, the system records the number $y-x$. So the system records show how number of passengers changed.

The test run was made for single bus and $n$ bus stops. Thus, the system recorded the sequence of integers $a_1,a_2,\dots ,a_n$ (exactly one number for each bus stop), where $a_i$ is the record for the bus stop $i$. The bus stops are numbered from $1$ to $n$ in chronological order.

Determine the number of possible ways how many people could be in the bus before the first bus stop, if the bus has a capacity equals to $w$

(that is, at any time in the bus there should be from $0$ to $w$

passengers inclusive).

Input

The first line contains two integers $n$

and $w$ $(1\le n\le 1000,1\le w\le {10}^9)$

— the number of bus stops and the capacity of the bus.

The second line contains a sequence $a_1,a_2,\dots ,a_n$

$(-{10}^6\le a_i\le {10}^6)$, where $a_i$ equals to the number, which has been recorded by the video system after the $i$

-th bus stop.

Output

Print the number of possible ways how many people could be in the bus before the first bus stop, if the bus has a capacity equals to $w$

. If the situation is contradictory (i.e. for any initial number of passengers there will be a contradiction), print 0.

Examples

Input

Copy

3 5
2 1 -3

Output

Copy

3

Input

Copy

2 4
-1 1

Output

Copy

4

Input

Copy

4 10
2 4 1 2

Output

Copy

2

Note

In the first example initially in the bus could be $0$

, $1$ or $2$

passengers.

In the second example initially in the bus could be $1$

, $2$, $3$ or $4$

passengers.

In the third example initially in the bus could be $0$

or $1$ passenger.

用mmax，mmin记录相对于起点的上车人数，下车人数。

w-mmax是起点最多可能的人数。

-mmin是起点至少有的人数。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>

const long long INF=0xfffffff;

using namespace std;

int n;
long long w;
long long a[1005];
long long mmin,mmax;
long long cur;
long long ans;

int main(){
    cin>>n>>w;
    cur=0;
    mmin=0;
    mmax=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<n;i++){
        cur+=a[i];
        mmax=max(mmax,cur);///get on start based
        mmin=min(mmin,cur);///get off start based
    }
    ans = w-mmax - (-mmin) + 1;
    if(ans<0){
        cout<<"0"<<endl;
    }else
        cout<<ans<<endl;

    return 0;
}