def dist(a, b):
    return sum((i-j)**2 for i, j in zip(a, b))
def combinationSum(self, candidates, target):
        candidates.sort()
        self.result = []
        self.dfs(candidates,target,0,[])
        return self.result