A room logs n integer temperature readings in order. A run of readings is "comfortable" when its warmest and coolest readings differ by at most limit (that is, max - min <= limit). Count how many contiguous runs (subarrays) are comfortable.
Input format
Line 1: two integers n and limit.
Line 2: n space-separated integers, the readings in order.
Output format
A single integer: the number of contiguous subarrays whose max - min is at most limit.
Constraints
- 1 ≤ n ≤ 100000
- 0 ≤ limit ≤ 2000000000
- -1000000000 ≤ each reading ≤ 1000000000