import java.util.Scanner;

public class Knapsack {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int W, n;
        W = scanner.nextInt();
        n = scanner.nextInt();
        int[] w = new int[n];
        for (int i = 0; i < n; i++) {
            w[i] = scanner.nextInt();
        }
        System.out.println(optimalWeight(W, w));
    }

    public static int optimalWeight(int W, int[] w2) {
        int j = w2.length;
        int[][] value = new int[W + 1][j + 1];

        for (int i = 0; i < j + 1; i++) {
            for (int w = 0; w < W + 1; w++) {
                if (i == 0 || w == 0) {
                    value[w][i] = 0;
                    continue;
                }
                value[w][i] = value[w][i - 1];
                if (w2[i - 1] <= w) {
                    int val = value[w - w2[i - 1]][i - 1] + w2[i - 1];
                    if (value[w][i] < val) {
                        value[w][i] = val;
                    }
                }
            }

        }

        return value[W][j];
    }

}