





'''simple docstring'''


def       __snake_case		( SCREAMING_SNAKE_CASE_ :			int )							->     int:

       """simple docstring"""


       UpperCAmelCase  =						[1]

       UpperCAmelCase,					UpperCAmelCase,					UpperCAmelCase  =						0, 0, 0
       UpperCAmelCase  =						ugly_nums[ia] * 2
       UpperCAmelCase  =						ugly_nums[ia] * 3
       UpperCAmelCase  =						ugly_nums[ia] * 5

       for _ in range(1			,	SCREAMING_SNAKE_CASE_ ):
              UpperCAmelCase  =						min(SCREAMING_SNAKE_CASE_			,	SCREAMING_SNAKE_CASE_			,	SCREAMING_SNAKE_CASE_ )
              ugly_nums.append(SCREAMING_SNAKE_CASE_ )
              if next_num == next_a:
                     ia += 1
                     UpperCAmelCase  =						ugly_nums[ia] * 2
              if next_num == next_a:
                     ia += 1
                     UpperCAmelCase  =						ugly_nums[ia] * 3
              if next_num == next_a:
                     ia += 1
                     UpperCAmelCase  =						ugly_nums[ia] * 5
       return ugly_nums[-1]


if __name__ == "__main__":
    from doctest import testmod

    testmod(verbose=True)
    print(F"""{ugly_numbers(200) = }""")








def        __UpperCAmelCase						(							lowerCamelCase_ :     List[str]  ,							lowerCamelCase_ :     Optional[Any]  )       ->  int:







			"""simple docstring"""





			SCREAMING_SNAKE_CASE_   : List[Any]					  =      [0 for i in range(r + 1  )]
			# nc0 = 1
			SCREAMING_SNAKE_CASE_   : Dict					  =      1
			for i in range(1  ,							n + 1  ):
						# to compute current row from previous row.
						SCREAMING_SNAKE_CASE_   : Optional[int]					  =      min(lowerCamelCase_  ,							lowerCamelCase_  )
						while j > 0:
									c[j] += c[j - 1]
									j -= 1
			return c[r]




print(binomial_coefficient(n=10, r=5))



