CSES - Subarray Sums I
  • Time limit: 1.00 s
  • Memory limit: 512 MB

Given an array of nn positive 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 a1,a2,,ana_1,a_2,\dots,a_n: the contents of the array.

Output

Print one integer: the required number of subarrays.

Constraints

  • 1n21051 \le n \le 2 \cdot 10^5
  • 1x,ai1091 \le x,a_i \le 10^9

Example

Input:

5 7
2 4 1 2 7

Output:

3