Problem:
Score : 200 points

Problem Statement

A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.

How many times will the ball make a bounce where the coordinate is at most X?

Constraints

1 \leq N \leq 100

1 \leq L_i \leq 100

1 \leq X \leq 10000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N X
L_1 L_2 ... L_{N-1} L_N

Output

Print the number of times the ball will make a bounce where the coordinate is at most X.

Sample Input 1

3 6
3 4 5

Sample Output 1

2

The ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.

Sample Input 2

4 9
3 3 3 3

Sample Output 2

4

The ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;

int main()
{
  /*
long long int x,y,z;
cin>>x>>y>>z;
long long int sum1=0,sum2=0,sum=0;
long long int borrow=0;
long long int c1=x/z+y/z,c2=(x+z-x%z)/z+y/z,c3=x/z+(y+z-y%z)/z,b1=z-x%z,b2=z-y%z;
sum=c1;
if(c1>=c2 and c1>=c3)
   ;
 else
{
  int check=0;
  if(b1<=y%z)
  {  borrow=b1;
    check=1;}
  if(b2<=x%z and borrow>b2)
    {borrow=b2;
    check=1;}
  if(check)
    sum=c2;
}
cout<<sum<<" "<<borrow;*/
int n,x;
cin>>n>>x;
int a[n];
for(int i=0;i<n;i++)
  cin>>a[i];
int sum=1,cord=0;
int p=0;
while(p<n and a[p]+cord<=x)
{
  cord+=a[p];
  p++;
  sum++;
}
cout<<sum;
return 0;
}