Subarray Sums

Given an array of $n$ 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.

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

Output

Print one integer: the required number of subarrays.

Constraints

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

Example 1

5 7
2 -1 3 5 -2

2

Explanation

The subarrays with sum $7$ are $[-1, 3, 5]$ and $[2, -1, 3, 5, -2]$.