Time limit: 1.00 s
Memory limit: 128 MB

Given is an array of $n$ numbers and an integer $x$ . Your task is to calculate the number of subarrays whose sum is $x$ .

A subarray is a contiguous segment in the array. The sum of a subarray is the sum of the numbers in the subarray.

Input

The first input line contains two integers: $n$ and $x$ .

The second input line contains $n$ integers: the numbers in the array.

Output

Output the number of subarrays whose sum is $x$ .

Constraints

$1 \le n \le 10^5$
$-10^9 \le x \le 10^9$
each array number is between $-10^9$ and $10^9$

Example

Input:

5 6
2 3 -1 4 2

Output:

In this case the array consists of numbers $[2,3,-1,4,2]$ . There are two subarrays whose sum is $6$ : $[3,-1,4]$ and $[4,2]$ .