




'''simple docstring'''







import sys

sys.set_int_max_str_digits(0)  # type: ignore






def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







		_snake_case	       =       [0] * 11
		_snake_case	       =       [0] * 11

		# mark last 9 numbers
		for _ in range(9  ):
				_snake_case	       =       1
				_snake_case	       =       number // 10
		# flag
		_snake_case	       =       True

		# check last 9 numbers for pandigitality

		for x in range(9  ):
				if not check_last[x + 1]:
						_snake_case	       =       False
		if not f:
				return f

		# mark first 9 numbers
		_snake_case	       =       int(str(lowercase_  )[:9]  )

		for _ in range(9  ):
				_snake_case	       =       1
				_snake_case	       =       number // 10

		# check first 9 numbers for pandigitality

		for x in range(9  ):
				if not check_front[x + 1]:
						_snake_case	       =       False
		return f






def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







		_snake_case	       =       [0] * 11

		# mark last 9 numbers
		for _ in range(9  ):
				_snake_case	       =       1
				_snake_case	       =       number // 10
		# flag
		_snake_case	       =       True

		# check last 9 numbers for pandigitality

		for x in range(9  ):
				if not check_last[x + 1]:
						_snake_case	       =       False
		return f






def 		_lowercase		(	):



		'''simple docstring'''







		_snake_case	       =       1
		_snake_case	       =       1
		_snake_case	       =       2
		# temporary Fibonacci numbers

		_snake_case	       =       1
		_snake_case	       =       1
		_snake_case	       =       2
		# temporary Fibonacci numbers mod 1e9

		# mod m=1e9, done for fast optimisation
		_snake_case	       =       [0] * 1000000
		_snake_case	       =       1000000000

		for x in range(1000000  ):
				_snake_case	       =       (aa + ba) % m
				_snake_case	       =       ba % m
				_snake_case	       =       ca % m
				if checka(lowercase_  ):
						_snake_case	       =       1

		for x in range(1000000  ):
				_snake_case	       =       a + b
				_snake_case	       =       b
				_snake_case	       =       c
				# perform check only if in tocheck
				if tocheck[x + 3] and check(lowercase_  ):
						return x + 3  # first 2 already done
		return -1


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











'''simple docstring'''







import unittest
from timeit import timeit






def 		_lowercase		(	lowercase_						,							lowercase_  ):



		'''simple docstring'''







		_snake_case	       =       first_num if first_num >= second_num else second_num
		_snake_case	       =       max_num
		while (common_mult % first_num > 0) or (common_mult % second_num > 0):
				common_mult += max_num
		return common_mult






def 		_lowercase		(	lowercase_						,							lowercase_  ):



		'''simple docstring'''







		return b if a == 0 else greatest_common_divisor(b % a						,							lowercase_  )






def 		_lowercase		(	lowercase_						,							lowercase_  ):



		'''simple docstring'''







		return first_num // greatest_common_divisor(lowercase_						,							lowercase_  ) * second_num






def 		_lowercase		(	):



		'''simple docstring'''







		_snake_case	       =       (
		    "from __main__ import least_common_multiple_slow, least_common_multiple_fast"
		)
		print(
		    "least_common_multiple_slow():"						,							timeit("least_common_multiple_slow(1000, 999)"						,							setup=lowercase_  )						,							)
		print(
		    "least_common_multiple_fast():"						,							timeit("least_common_multiple_fast(1000, 999)"						,							setup=lowercase_  )						,							)





class      lowerCamelCase_							(       unittest.TestCase							):




					'''simple docstring'''






					lowercase__    = (
					    (1_0, 2_0),
					    (1_3, 1_5),
					    (4, 3_1),
					    (1_0, 4_2),
					    (4_3, 3_4),
					    (5, 1_2),
					    (1_2, 2_5),
					    (1_0, 2_5),
					    (6, 9),
					)
					lowercase__    = (2_0, 1_9_5, 1_2_4, 2_1_0, 1_4_6_2, 6_0, 3_0_0, 5_0, 1_8)






					def 				__SCREAMING_SNAKE_CASE	(    self ):
							for i, (first_num, second_num) in enumerate(self.test_inputs ):
									_snake_case	       =       least_common_multiple_slow(__UpperCamelCase,  __UpperCamelCase )
									_snake_case	       =       least_common_multiple_fast(__UpperCamelCase,  __UpperCamelCase )
									with self.subTest(i=__UpperCamelCase ):
											self.assertEqual(__UpperCamelCase,  self.expected_results[i] )
											self.assertEqual(__UpperCamelCase,  self.expected_results[i] )


if __name__ == "__main__":
						benchmark()
						unittest.main()





