


def 			lowerCAmelCase__					(     a__:						str     ,    a__:						str			)    ->						bool:


							'''simple docstring'''





							_UpperCAmelCase											=     len(a__			)
							_UpperCAmelCase											=     len(a__			)
							_UpperCAmelCase											=     [[False for _ in range(m + 1			)] for _ in range(n + 1			)]
							_UpperCAmelCase											=     True
							for i in range(a__			):
														for j in range(m + 1			):
																					if dp[i][j]:
																												if j < m and a[i].upper() == b[j]:
																																			_UpperCAmelCase											=     True
																												if a[i].islower():
																																			_UpperCAmelCase											=     True
							return dp[n][m]


if __name__ == "__main__":
		import doctest

		doctest.testmod()




def 			lowerCAmelCase__					(     a__:						int     ,    a__:						int			)    ->						int:


							'''simple docstring'''





							return x if y == 0 else greatest_common_divisor(a__     ,    x % y			)

def 			lowerCAmelCase__					(     a__:						int     ,    a__:						int			)    ->						int:


							'''simple docstring'''





							return (x * y) // greatest_common_divisor(a__     ,    a__			)

def 			lowerCAmelCase__					(     a__:						int = 2_0			)    ->						int:


							'''simple docstring'''





							_UpperCAmelCase											=     1
							for i in range(1     ,    n + 1			):
														_UpperCAmelCase											=     lcm(a__     ,    a__			)
							return g


if __name__ == "__main__":
		print(f'''{solution() = }''')
