



def       lowerCamelCase_  (    _a       :						Tuple   ,		_a       :						Optional[Any]   ,		_a       :						List[str]   ,		_a       :						str   ,		_a       :						List[Any]    ):



    '''simple docstring'''




    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       lowerCamelCase_  (    _a       :						int   ,		_a       :						List[Any]    ):



    '''simple docstring'''




    UpperCAmelCase_     :       Tuple  		=					[]  # type: list[int]
    UpperCAmelCase_     :       Optional[int]  		=					[]  # type: list[int]
    backtrack(__lowercase   ,		__lowercase   ,		__lowercase   ,		__lowercase   ,		0    )
    return answer







def       lowerCamelCase_  (    ):



    '''simple docstring'''




    print(combination_sum([-8, 2.3, 0]   ,		1    )    )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()




def   snake_case_    (			__lowercase      ,							__lowercase      ,							__lowercase      ,							__lowercase							):
   UpperCAmelCase_				:   Optional[int]							= int((lower_bound + upper_bound) // 2							)
   if array[r] == value:
      return r
   if lower_bound >= upper_bound:
      return -1
   if array[r] < value:
      return binary_search(__lowercase      ,							r + 1      ,							__lowercase      ,							__lowercase							)
   else:
      return binary_search(__lowercase      ,							__lowercase      ,							r - 1      ,							__lowercase							)
def   snake_case_    (			__lowercase      ,							__lowercase							):
   UpperCAmelCase_				:   Union[str, Any]							= 0
   if matrix[index][0] == value:
      return [index, 0]
   while index < len(__lowercase							) and matrix[index][0] < value:
      UpperCAmelCase_				:   str							= binary_search(matrix[index]      ,							0      ,							len(matrix[index]							) - 1      ,							__lowercase							)
      if r != -1:
         return [index, r]
      index += 1
   return [-1, -1]


if __name__ == "__main__":
       import doctest

       doctest.testmod()