






"""simple docstring"""







def 						lowercase__(A						)    ->int:




						"""simple docstring"""



						lowercase__    :				Tuple=	[1]

						lowercase__,     lowercase__,     lowercase__    :				int=	0, 0, 0
						lowercase__    :				List[str]=	ugly_nums[ia] * 2
						lowercase__    :				List[Any]=	ugly_nums[ia] * 3
						lowercase__    :				Union[str, Any]=	ugly_nums[ia] * 5

						for _ in range(1 ,		A						):
												lowercase__    :				Dict=	min(A ,		A ,		A						)
												ugly_nums.append(A						)
												if next_num == next_a:
																		ia += 1
																		lowercase__    :				Optional[int]=	ugly_nums[ia] * 2
												if next_num == next_a:
																		ia += 1
																		lowercase__    :				Any=	ugly_nums[ia] * 3
												if next_num == next_a:
																		ia += 1
																		lowercase__    :				Union[str, Any]=	ugly_nums[ia] * 5
						return ugly_nums[-1]


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

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














"""simple docstring"""







from __future__ import annotations





def 						lowercase__(A ,		A						)    ->list[str]:




						"""simple docstring"""



						if partitions <= 0:
												raise ValueError("partitions must be a positive number!"						)
						if partitions > number_of_bytes:
												raise ValueError("partitions can not > number_of_bytes!"						)
						lowercase__    :				List[str]=	number_of_bytes // partitions
						lowercase__    :				Dict=	[]
						for i in range(A						):
												lowercase__    :				Union[str, Any]=	i * bytes_per_partition + 1
												lowercase__    :				Any=	(
												    number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
												)
												allocation_list.append(f'''{start_bytes}-{end_bytes}'''						)
						return allocation_list


if __name__ == "__main__":
			import doctest

			doctest.testmod()






