A billing period lists n invoices in order, each a positive integer amount. Count how many contiguous runs of invoices have a total amount within the inclusive range [L, R].
Input format
Line 1: three integers n, L, and R.
Line 2: n space-separated positive integers, the invoice amounts in order.
Output format
A single integer: the number of contiguous subarrays whose sum is at least L and at most R.
Constraints
- 1 ≤ n ≤ 100000
- 1 ≤ each amount ≤ 1000000
- 0 ≤ L ≤ R ≤ 1000000000000