#include <iostream>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 2e9;

int main() {
    int n, k;
    cin >> k >> n;

    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int res = INF;
    for(int bitmask = 0; bitmask < (1 << n); bitmask++) {
        if(__builtin_popcount(bitmask) == k - 1) {
            int sum = 0, max_sum = 0;
            for(int i = 0; i < n; i++) {
                if(bitmask & (1 << i)) {
                    sum = v[i];
                }
                else {
                    sum += v[i];
                }
                max_sum = max(max_sum, sum);
            }
            res = min(res, max_sum);
        }
    }

    cout << res << endl;
    return 0;
}