
def  a_	( __lowercase     :			list ,      __lowercase     :			list ,      __lowercase     :			list ,      __lowercase     :			int ,      __lowercase     :			int				)				->						None:
			if target == 0:
						answer.append(path.copy()				)
			else:
						for index in range(__lowercase ,      len(__lowercase				)				):
									if target >= candidates[index]:
												path.append(candidates[index]				)
												backtrack(__lowercase ,      __lowercase ,      __lowercase ,      target - candidates[index] ,      __lowercase				)
												path.pop(len(__lowercase				) - 1				)






def  a_	( __lowercase     :			list ,      __lowercase     :			int				)				->						list:
			_snake_case						=    []  # type: list[int]
			_snake_case						=    []  # type: list[int]
			backtrack(__lowercase ,      __lowercase ,      __lowercase ,      __lowercase ,      0				)
			return answer






def  a_	( )				->						None:
			print(combination_sum([-8, 2.3, 0] ,      1				)				)


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			main()

def  a_	( __lowercase     :			int				)				->						bool:
			_snake_case						=    9

			while num > 0:
						if num % 10 != digit:
									return False
						num //= 100
						digit -= 1

			return True






def  a_	( )				->						int:
			_snake_case						=    138_902_663

			while not is_square_form(num * num				):
						if num % 10 == 3:
									num -= 6  # (3 - 6) % 10 = 7
						else:
									num -= 4  # (7 - 4) % 10 = 3

			return num * 10


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