






"""simple docstring"""






def  __lowerCamelCase					(					lowerCAmelCase__       ,lowerCAmelCase__				):
				A__							 =       int(__lowerCAmelCase				)

				# Initialize Result
				A__							 =       []

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

				return answer


# Driver Code
if __name__ == "__main__":
	SCREAMING_SNAKE_CASE						:						int					   =       []
	SCREAMING_SNAKE_CASE						:						List[str]					   =       '''0'''

	if (
	    input('''Do you want to enter your denominations ? (yY/n): ''').strip().lower()
	    == "y"
	):
		SCREAMING_SNAKE_CASE						:						Tuple					   =       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()))
		SCREAMING_SNAKE_CASE						:						List[str]					   =       input('''Enter the change you want to make in Indian Currency: ''').strip()
	else:
		# All denominations of Indian Currency if user does not enter
		SCREAMING_SNAKE_CASE						:						Dict					   =       [1, 2, 5, 10, 20, 50, 100, 500, 2_000]
		SCREAMING_SNAKE_CASE						:						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}: ''')
		SCREAMING_SNAKE_CASE						:						Optional[Any]					   =       find_minimum_change(denominations, value)
		# Print result
		for i in range(len(answer)):
			print(answer[i], end=''' ''')










"""simple docstring"""






print((lambda quine: quine % quine)('''print((lambda quine: quine %% quine)(%r))'''))


