Subarray Product Less Than K

class Solution:
    def numSubarrayProductLessThanK(self, nums, k):
        N = len(nums)
        if k <= 1:
            return 0
        lx = 0
        prod = 1
        count = 0
        for rx in range(0, N, 1):
            prod = prod * nums[rx]
            while prod >= k:
                prod = prod // nums[lx]
                lx = lx + 1
            count = count + (rx - lx + 1)
        return count