Given n daily ledger entries (signed integers) and two bounds lo and hi (lo <= hi), count the number of contiguous subarrays (windows of consecutive days) whose sum S satisfies lo <= S <= hi. Print this count.
Input format
Line 1: three integers n lo hi.
Line 2: n space-separated integers, the ledger entries.
Output format
A single integer: the number of contiguous subarrays whose sum lies in [lo, hi].
Constraints
- 1 <= n <= 100000
- -1000000000 <= lo <= hi <= 1000000000
- -1000000 <= entry <= 1000000