
















class Solution:
    def __init__(self):
        self.res = []
        

    def combinationSum(self, candidates, target):
        cand = sorted(can)
        for i in candidates:
            if i == target:


    def dfs(self, cand, target):






s = Solution()
print(s.combinationSum([2, 3, 6, 7], 7))                