def solution(n, m):
# greatest common divisor
# least common multiple
common_divisors = []
for i in range(1, n+1 if n >=m else m+1):
if n%i== 0 and m%i == 0:
common_divisors.append(i)
common_multiple = 1
for j in range(1, n*m+1):
if j%n == 0 and j%m == 0:
common_multiple = j
break
return [max(common_divisors), common_multiple]