#include <bits/stdc++.h>
using namespace std;
int w, n;
int g[50];
int ans = 0;

void dfs (int num, int wei) {
    ans = max (ans, wei);
    for (int q = num + 1; q <= n; ++q) {
        if (wei + g[q] <= w) {
            dfs (q, wei + g[q]);
        }
    }
}

int main () {
    freopen ("giftgiving.in", "r", stdin);
    freopen ("giftgiving.out", "w", stdout);
    scanf ("%d %d", &w, &n);
    for (int q = 1; q <= n; ++q) {
        scanf ("%d", &g[q]);
    }
    dfs (0, 0);
    printf ("%d\n", ans);
    return 0;
}