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 (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>

int main(void)
{
	int n, x;
	scanf("%d %d",&n,&x);
	int *l;
	l = (int*)malloc(sizeof(int)*(n+2));
	int i =0;
	while (i < n)
	{
		scanf("%d",&(l[i]));
		i++;
	}
	i = 0;
	int *d;
	int sum = 1;
	d = (int*)malloc(sizeof(int)*(n+3));
	d[0] = 0;
	d[1] = 0;
	i = 2;
	while (i < n+2)
	{
		d[i] = d[i-1]+l[i-2];
		if(d[i]<=x)
		{
			sum++;
		}
		i++;
	}
	printf("%d\n",sum);

	return(0);
}