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

def 	__lowerCamelCase							(				__a    : list      ,							__a    : int		)      ->       list:
	_lowercase   =[]  # type: list[int]
	_lowercase   =[]  # type: list[int]
	backtrack(__a      ,							__a      ,							__a      ,							__a      ,							0		)
	return answer

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


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						main()







def   UpperCamelCase(   lowercase_				)      ->							str:





  '''simple docstring'''





  return "".join(chr(ord(lowercase_				) + 32				) if """A""" <= char <= """Z""" else char for char in word				)


if __name__ == "__main__":
    from doctest import testmod

    testmod()