def get_lcm(l):
  def find_lcm(num1, num2): 
  	if(num1>num2): 
  		num = num1 
  		den = num2 
  	else: 
  		num = num2 
  		den = num1 
  	rem = num % den 
  	while (rem != 0): 
  		num = den 
  		den = rem 
  		rem = num % den 
  	gcd = den 
  	lcm = int(int(num1 * num2)/int(gcd)) 
  	return lcm 
  
  num1 = l[0]
  num2 = l[1]
  lcm = find_lcm(num1, num2)
  for i in range(2, len(l)):
    lcm = find_lcm(lcm, l[i])
  return lcm 
def min_cost(cost, m, n):
	R = 3
	C = 3
	 
	tc = [[0 for x in range(C)] for x in range(R)] 
	tc[0][0] = cost[0][0] 
	for i in range(1, m+1): 
		tc[i][0] = tc[i-1][0] + cost[i][0] 
	for j in range(1, n+1): 
		tc[0][j] = tc[0][j-1] + cost[0][j] 
	for i in range(1, m+1): 
		for j in range(1, n+1): 
			tc[i][j] = min(tc[i-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j] 
	return tc[m][n]