Find the Playing Note

Farmer John is teaching his cows to play a song. The song consists of $N$ notes ($1 \le N \le 10{,}000$), and the $i$-th note lasts $B_i$ beats ($1 \le B_i \le 120$), so the whole song is at most $1{,}200{,}000$ beats long.

Playing starts at time $0$. Note $1$ is played from time $0$ up to just before time $B_1$, note $2$ from time $B_1$ up to just before $B_1 + B_2$, and in general note $i$ occupies the half-open interval $[B_1 + \dots + B_{i-1},\ B_1 + \dots + B_i)$.

To keep the cows paying attention, Farmer John asks $Q$ questions ($1 \le Q \le 50{,}000$). Each question gives a time $T$ and asks: during the interval from time $T$ up to just before time $T + 1$, which note should be playing? Every query satisfies $0 \le T < B_1 + \dots + B_N$, so exactly one note is being played. Report its $1$-based index.

• Line 1: two space-separated integers $N$ and $Q$.
• Lines 2 to $N+1$: line $i+1$ contains the single integer $B_i$.
• Lines $N+2$ to $N+Q+1$: line $N+i+1$ contains the single integer $T_i$, the time asked by the $i$-th query.

• $Q$ lines: line $i$ contains a single integer, the $1$-based index of the note being played during the $i$-th query's interval.