class Solution {
    public int numSubarrayProductLessThanK(int[] nums, int k) {
        int count = 0;
        HashSet<Integer[]> hash = new HashSet<Integer[]>();
        for(int left = 0; left < nums.length; left++){
            for(int right = left; right < nums.length; right++){
                int product = checkProduct(left, right, nums);
                if(product < k){
                    count++;
                    Integer[] input = new Integer[right - left + 1];
                    int s = 0;
                    for(int x = left; x <= right; x++){
                        input[s] = nums[x];
                        s++;
                    }
                    hash.add(input);
                    //printOutput(left, right, nums);
                }
            }
        }
        return  hash.size();
    }

    private static int checkProduct(int left, int right, int[] nums){
        int product = 1;
        for(int i = left; i <= right; i++){
            product = nums[i] * product;
        }
        return product;
    }

     private static void printOutput(int left, int right, int[] nums){

        for(int i = left; i <= right; i++){
            System.out.print(nums[i] + " ");
        }
        System.out.println();
    }


}