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)

fn get_input() -> String {
    let mut word = String::new();
    std::io::stdin().read_line(&mut word).unwrap();
    word.trim().to_owned()
}

fn main() {
    let (n, x) = {
        let line = get_input();
        let mut split = line.split_whitespace();
        let n:i32 = split.next().unwrap().parse().unwrap();
        let x:i32 = split.next().unwrap().parse().unwrap();
        (n, x)
    };

    // let mut l:Vec<i32> = Vec::new();
    let mut ans = 1;
    let mut d = 0;
    {
        let line = get_input();
        let mut split = line.split_whitespace();
        for _ in 0..n {
            let l:i32 = split.next().unwrap().parse().unwrap();
            d = d + l;
            if d > x {
                break;
            }
            ans += 1;

        }
    }

    println!("{}", ans);
}