





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)							-> list[int]:




    """simple docstring"""




    _A     =							int(_SCREAMING_SNAKE_CASE				)

    # Initialize Result
    _A     =							[]

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

    return answer


# Driver Code
if __name__ == "__main__":
 __A							:			int         =			[]
 __A							:			List[Any]         =			"0"

 if (
     input("Do you want to enter your denominations ? (yY/n): ").strip().lower()
     == "y"
 ):
  __A							:			Optional[Any]         =			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							:			Any         =			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							:			Optional[Any]         =			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							:			int         =			find_minimum_change(denominations, value)
  # Print result
  for i in range(len(answer)):
   print(answer[i], end=" ")










def        __lowerCAmelCase		(	__lowerCamelCase						:     int					, __lowerCamelCase						:     int						)	->    bool:
					return numa ^ numa < 0


if __name__ == "__main__":
				import doctest

				doctest.testmod()




