Subarray Sums II

Given an array of $nn$ integers, your task is to count the number of subarrays having sum $xx$.

Input

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

The next line has $nn$ integers $a_1,a_2,\dots ,a_{n}a\_1,a\_2,\backslash dots,a\_n$: the contents of the array.

Output

Print one integer: the required number of subarrays.