def no_of_subsequences(arr, k):
    if k <= 0:
        return 0
    
    count = 0
    n = len(arr)
    
    for i in range(1, 2**n):
        product = 1
        for j in range(n):
            if i & (1 << j):
                product *= arr[j]
                if product >= k:
                    break
        if product < k:
            count += 1
    
    return count