Time Limit : sec, Memory Limit : KB

# The Number of Windows

For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and $Q$ integers $x_i$ as queries, for each query, print the number of combinations of two integers $(l, r)$ which satisfies the condition: $1 \leq l \leq r \leq N$ and $a_l + a_{l+1} + ... + a_{r-1} + a_r \leq x_i$.

## Constraints

• $1 \leq N \leq 10^5$
• $1 \leq Q \leq 500$
• $1 \leq a_i \leq 10^9$
• $1 \leq x_i \leq 10^{14}$

## Input

The input is given in the following format.

$N$ $Q$
$a_1$ $a_2$ ... $a_N$
$x_1$ $x_2$ ... $x_Q$

## Output

For each query, print the number of combinations in a line.

## Sample Input 1

6 5
1 2 3 4 5 6
6 9 12 21 15


## Sample Output 1

9
12
15
21
18