def make_divisors(n): lower_divisors , upper_divisors = [], [] i = 1 while i*i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i and i!=1: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] N,H = map(int, input().split()) D = make_divisors(N) L = [] for d in D: L.extend([d]*d) if H**2