





'''simple docstring'''




from pathlib import Path

import fire



def 		__A		(  lowerCamelCase_			,			lowerCamelCase_			,			lowerCamelCase_	):


		"""simple docstring"""



		SCREAMING_SNAKE_CASE :				Tuple		=			Path(lowerCamelCase_	)
		SCREAMING_SNAKE_CASE :				Optional[int]		=			Path(lowerCamelCase_	)
		dest_dir.mkdir(exist_ok=lowerCamelCase_	)
		for path in src_dir.iterdir():
				SCREAMING_SNAKE_CASE :				Union[str, Any]		=			[x.rstrip() for x in list(path.open().readlines()	)][:n]
				SCREAMING_SNAKE_CASE :				Any		=			dest_dir.joinpath(path.name	)
				print(lowerCamelCase_	)
				dest_path.open("""w"""	).write("""\n""".join(lowerCamelCase_	)	)


if __name__ == "__main__":
							fire.Fire(minify)










'''simple docstring'''




from math import factorial



def 		__A		(  lowerCamelCase_			,			lowerCamelCase_	):


		"""simple docstring"""



		if n < k or k < 0:
				raise ValueError("""Please enter positive integers for n and k where n >= k"""	)
		return factorial(lowerCamelCase_	) // (factorial(lowerCamelCase_	) * factorial(n - k	))


if __name__ == "__main__":
							print(
							    """The number of five-card hands possible from a standard""",
							    f'''fifty-two card deck is: {combinations(52, 5)}\n''',
							)

							print(
							    """If a class of 40 students must be arranged into groups of""",
							    f'''4 for group projects, there are {combinations(40, 4)} ways''',
							    """to arrange them.\n""",
							)

							print(
							    """If 10 teams are competing in a Formula One race, there""",
							    f'''are {combinations(10, 3)} ways that first, second and''',
							    """third place can be awarded.""",
							)



