Subarray Product Less Than K

Given an array of integers `nums` and an integer `k`, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than `k`. ### Constraints - `1 <= nums.length <= 3 * 10^4` - `1 <= nums[i] <= 1000` - `0 <= k <= 10^6` ### Input Format First line contains the integer `k`. Second line contains space-separated integers representing `nums`. ### Output Format Print the number of qualifying contiguous subarrays.