"""simple docstring"""







def 						__UpperCAmelCase       (					UpperCAmelCase_					:       list[int]    ,							UpperCAmelCase_					:       str						)							->    list[int]:

	'''simple docstring'''





	__snake_case    :							Union[str, Any]   	=				int(UpperCAmelCase_						)

	# Initialize Result
	__snake_case    :							int   	=				[]

	# Traverse through all denomination
	for denomination in reversed(UpperCAmelCase_						):
		# Find denominations
		while int(UpperCAmelCase_						) >= int(UpperCAmelCase_						):
			total_value -= int(UpperCAmelCase_						)
			answer.append(UpperCAmelCase_						)  # Append the "answers" array

	return answer


# Driver Code
if __name__ == "__main__":
	_a  :  Optional[int]=				[]
	_a  :  Optional[int]=				"0"

	if (
	    input("Do you want to enter your denominations ? (yY/n): ").strip().lower()
	    == "y"
	):
		_a  :  int=				int(input("Enter the number of denominations you want to add: ").strip())

		for i in range(0, n):
			denominations.append(int(input(f'''Denomination {i}: ''').strip()))
		_a  :  Optional[int]=				input("Enter the change you want to make in Indian Currency: ").strip()
	else:
		# All denominations of Indian Currency if user does not enter
		_a  :  Tuple=				[1, 2, 5, 10, 20, 50, 100, 500, 2_000]
		_a  :  List[str]=				input("Enter the change you want to make: ").strip()

	if int(value) == 0 or int(value) < 0:
		print("The total value cannot be zero or negative.")

	else:
		print(f'''Following is minimal change for {value}: ''')
		_a  :  List[Any]=				find_minimum_change(denominations, value)
		# Print result
		for i in range(len(answer)):
			print(answer[i], end=" ")






"""simple docstring"""







from __future__ import annotations
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       int						)							->    list[int]:

	'''simple docstring'''





	__snake_case    :							Union[str, Any]   	=				[True] * limit
	__snake_case    :							Tuple   	=				False
	__snake_case    :							Union[str, Any]   	=				False
	__snake_case    :							List[str]   	=				True

	for i in range(3    ,							int(limit**0.5 + 1						)    ,							2						):
		__snake_case    :							List[str]   	=				i * 2
		while index < limit:
			__snake_case    :							List[str]   	=				False
			__snake_case    :							Union[str, Any]   	=				index + i

	__snake_case    :							str   	=				[2]

	for i in range(3    ,							UpperCAmelCase_    ,							2						):
		if is_prime[i]:
			primes.append(UpperCAmelCase_						)

	return primes
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       int = 1_00_00_00						)							->    int:

	'''simple docstring'''





	__snake_case    :							Tuple   	=				prime_sieve(UpperCAmelCase_						)
	__snake_case    :							int   	=				0
	__snake_case    :							str   	=				0

	for i in range(len(UpperCAmelCase_						)						):
		for j in range(i + length    ,							len(UpperCAmelCase_						)						):
			__snake_case    :							Union[str, Any]   	=				sum(primes[i:j]						)
			if sol >= ceiling:
				break

			if sol in primes:
				__snake_case    :							List[Any]   	=				j - i
				__snake_case    :							Optional[Any]   	=				sol

	return largest


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





