Given an array of integers nums and an integer k, return the number of contiguous subarrays such that the product of all elements in each subarray is strictly less than k.

Constraints:

• $1 \leq$ nums.length $\leq 3 \times 10^4$

• $1 \leq$ nums[i] $\leq 10^3$ ...