ZA. Subarray Sums I
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Given an array of $$$n$$$ $$$\textbf{positive}$$$ integers, your task is to count the number of subarrays having sum $$$x$$$.

Input

The first input line has two integers $$$n$$$ and $$$x$$$: the size of the array and the target sum $$$x$$$.

The second line has $$$n$$$ integers $$$a_1,a_2,\dots,a_n$$$: the contents of the array.

Constraints:

  • $$$1 \le n \le 2 \cdot 10^5$$$
  • $$$1 \le x,a_i \le 10^9$$$
Output

Print one integer: the required number of subarrays.

Example
Input
5 7
2 4 1 2 7
Output
3