Факторизация чисел

def count_find_num(primesL, limit):
    primes = []
    primes_new = []
    Primescount = 1
    Max_primes = 0
    for i in range(0, len(primesL)):
        Primescount *= primesL[i]
    for i in range(0, limit):
        primes.append(i)
    for i in range(0, limit-1):
        if primes[i] != 0 and primes[i] % Primescount == 0:
            primes_new.append(primes[i])
    for i in range(1, (len(primes_new)-1)):
        if primes_new[i] > primes_new[i-1]:
            Max_primes = primes_new[i]
    return [len(primes_new)-1, Max_primes]
 
primesL = list(map(int, input().split()))
limit = int(input())
print(count_find_num(primesL, limit))

def primfacs(n):
    i = 2
    primfac = []
    while i * i <= n:
        while n % i == 0:
            primfac.append(i)
            n = n / i
        i = i + 1
    if n > 1:
        primfac.append(int(n))
    return primfac
 
def count_find_num(a, b):
    for i in range(2, b+1):
        d = primfacs(i)
        if set(a).issubset(set(d)): 
            print(i, d)
 
 
primesL = [2, 3, 5]
limit = 490
 
count_find_num(primesL, limit)

delit = [2,3,5,7,11,13]
cntr = 1e6
 
k = 1
res = {}
for i in delit:
    k *= i
res[k] = delit[:]
 
while True:
    flag = True
    for d in delit:
        for k in list(res):
            if k*d < cntr+1 and k*d not in res:
                res[k*d] = res.get(k) + [d]
                flag = False
    if flag:
        break
 
for k in sorted(res):
    print(k, sorted(res[k]))