ITSA C_CH11

import java.util.*;

public class Main {
    static Scanner sc = new Scanner(System.in);
    static int MAX, totalWeight, n, sol = 0;
    static Map<Integer, Integer> weight = new HashMap<>();
    static List<Integer> solution = new ArrayList<>();
    static Map<Integer, List<Integer>> Solution = new HashMap<>();
    public static void main(String args[]) {
        String[] input = sc.nextLine().split(",");
        totalWeight = Integer.parseInt(input[0]);
        MAX = Integer.parseInt(input[1]);
        n = Integer.parseInt(input[2]);
        for(int i = 3; i < 3 + n; i++){
            weight.put(i - 3, Integer.parseInt(input[i]));
        }
        backtracking(1, totalWeight);
        System.out.println(Solution.get(1));
    }
    public static void backtracking(int taked, int weighted){
        if(taked == MAX){
            if(weighted == 0)
                Solution.put(sol++, solution);
            return;
        }
        for(int i = 0; i < n; i++){
            if(weight.get(i) == null)
                continue;
            int newWeight = weighted - weight.get(i);
            if(newWeight >= 0){
                solution.add(i);
                int value = weight.get(i);
                weight.remove(i);
                backtracking(taked + 1, newWeight);
                weight.put(i, value);
                solution.remove(solution.size() - 1);
            }
        }
    }
}