class Solution {
List<List<Integer>> res;
public List<List<Integer>> combine(int n, int k) {
res = new ArrayList<>();
List<Integer> track = new ArrayList<>();
backtrack(n,k,1,track);
return res;
}
public void backtrack(int n , int k, int target , List<Integer> track){
if(track.size() == k){
res.add(new ArrayList<>(track));
}
for(int i = target ; i <= n ; i++){
track.add(i);
backtrack(n,k,i+1 ,track);
track.remove(track.size() -1 );
}
}
}