408014: GYM102961 ZB Subarray Sums II

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

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$$$
• $$$-10^9 \le x,a_i \le 10^9$$$

Print one integer: the required number of subarrays.

5 7
2 -1 3 5 -2

2