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: Runtime Error)

#include <stdio.h>
//第１３０回　ＡＢＣ問題

//その跳ねた回数iを返してあげる。Dに関してマックスを求め、そのマックスとなった時のiを考える。

int bound(int N, int X, int L[])
{
	int D[100];
	int i;
	int temp[100];
	int max = 0;

	D[0] = 0;
	for (i = 1; i < N; i++)
	{
		D[i] = D[i - 1] + L[i - 1];

	}

	for (i = 0; i < N; i++)
	{
		if (X >= D[i]);
		{
			temp[i] = D[i];
		}
	}

	max = temp[0];
	for (i = 0; i < N; i++)
	{

		if (max < temp[i])
		{
			max = temp[i];
		}
	}

	return max;
}



int main()
{
	int N, X = 0;
	int L[100] = {0};
	int i=0;

	scanf("%d %d", &N, &X);

	for (i = 0; i < 3 ;i++)
	{
		scanf("%d", L[i]);
	}

	printf("%d\n", bound(N, X, L));

	return 0;



}