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 Rust (1.15.1) (judge verdict: Accepted)

use std::io;
use std::str::FromStr;

fn main() {
    let mut first_line = String::new();
    io::stdin().read_line(&mut first_line).unwrap();

    let first_line_words:Vec<&str> = first_line.trim().split(" ").collect();
    let _ = i32::from_str(first_line_words[0]).unwrap();
    let x = i32::from_str(first_line_words[1]).unwrap();

    let mut counter = 1;
    let mut position = 0;
    let mut line = String::new();
    io::stdin().read_line(&mut line).unwrap();

    let words:Vec<&str> = line.trim().split(" ").collect();
    for word in words {
        position = position + i32::from_str(word).unwrap();
        if position <= x {
            counter = counter + 1;
        }
    }
    println!("{}", counter);

}