Code Submission Evaluation System Login

CSES Problem Set

Subarray Sums II


Task | Statistics


CSES - Subarray Sums IICSES - Subarray Sums II

Time limit:1.00 s Memory limit:512 MB

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 $x$.

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
Example

Input:
5 7
2 -1 3 5 -2


Output:
2