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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

'use strict';
function Main(input) {
  // 1行目がinput[0], 2行目がinput[1], …に入る
  let inputs = input.split("\n");
  let tmp1 = inputs[0].split(" ");
  let l = inputs[1].split(" ");
  //文字列から10進数に変換するときはparseIntを使います
  let n = parseInt(tmp1[0], 10);
  let x = parseInt(tmp1[1], 10);

  let d = [];
  d.push(0);

  l.map(elm => parseInt(elm, 10))
    .forEach((elm, i) => {
    d[i + 1] = d[i] + elm;
  });

  console.log(d.findIndex(isLargeNumber));

  function isLargeNumber(element) {
    return element > x;
  }

  //出力
  // console.log('%d %s', b, c);
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));