# Subarray Sums I

Easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

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

## Input

The first line contains the size of the array $n(1≤n≤2⋅10_{5})$ and the target sum $x(1≤x≤10_{9})$. The next line contains $n$ integers $a_{1},a_{2},...,a_{n}(1≤a_{i}≤10_{9})$ — the contents of the array.

## Output

Print the required number of subarrays.

## Examples

Input #1

Answer #1

Submissions 148

Acceptance rate 19%