Given an array with elements, find the number of subarrays such that .
The first line will have space-separated and .
The second line will have the array, with each element being between and , inclusive.
Output the number of distinct subarrays that satisfy the condition. Two subarrays are different if they occupy a different range of elements, even if the elements themselves are the same.
5 2 0 3 2 1 4