Subarray Sums I

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

Input

The first line contains the size of the array $n(1\le n\le 2\cdot 10^5)$ and the target sum $x(1\le x\le 10^9)$. The next line contains $n$ integers $a_1,a_2,...,a_n(1\le a_i\le 10^9)$ — the contents of the array.

Output

Print the required number of subarrays.

Examples