def find_subarrays(arr, target):
result = []
i = j = 0
product = 1
while i < len(arr):
product = product * arr[j]
if product < target:
if i == j:
result.append(arr[i:i+1])
else:
result.append(arr[i:j+1])
if j < len(arr) - 1:
j += 1
else:
i += 1
product = 1
j = i
else:
i += 1
product = 1
j = i
return result