class Solution {
public:

    vector<vector<int>> ans;

    void solve(int sum,vector<int> v,vector<int>& candidates, int target){


        for(int i=0;i<candidates.size();i++){
            int tsum=sum+candidates[i];
            if(tsum>target){
                return;
            }else if(tsum==target){
                v.push_back(candidates[i]);
                ans.push_back(v);
            }else{
                v.push_back(candidates[i]);
                solve(tsum,v,candidates,target);
            }
        }


        return;
    }


    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {

        vector<int> v;
        sort(candidates.begin(),candidates.end());
        solve(0,v,candidates,target);


        return ans;
    }
};