Given an array of ~n~ positive 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

• ~1 \le n \le 2 \cdot 10^5~
• ~1 \le x,a\_i \le 10^9~

Example Input

5 7
2 4 1 2 7

Example Output

3