'''
8.4
'''

M = [-10, -5, 1, 2, 3, 4, 10, 15, 5]
a, b = 1, 5

M.sort()

def multiply(some_list):
    if 0 in some_list:
        return 0
    else:
        result = 1
        for element in some_list:
            result *= element
        return result

def subsets(S):
    sets = []
    len_S = len(S)
    for i in range(2**len_S):
        subset = [S[bit] for bit in range(len_S) if i & (2**bit)]
        if multiply(subset) <= b and multiply(subset) >= a:
            sets.append(subset)
    return sets

i = 0

for m in subsets(M):
    print(m, end = ' ')
    i += 1
print('\nВсего подмножеств, удовлетворяющих условию:', i)