{"raw_statement":[{"iden":"problem statement","content":"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}$.\nHow many times will the ball make a bounce where the coordinate is at most $X$?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 100$\n*   $1 \\leq L_i \\leq 100$\n*   $1 \\leq X \\leq 10000$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $X$\n$L_1$ $L_2$ $...$ $L_{N-1}$ $L_N$"},{"iden":"sample input 1","content":"3 6\n3 4 5"},{"iden":"sample output 1","content":"2\n\nThe ball will make a bounce at the coordinates $0$, $3$, $7$ and $12$, among which two are less than or equal to $6$."},{"iden":"sample input 2","content":"4 9\n3 3 3 3"},{"iden":"sample output 2","content":"4\n\nThe ball will make a bounce at the coordinates $0$, $3$, $6$, $9$ and $12$, among which four are less than or equal to $9$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}