#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 30;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)

int sum[101];

int main(){
	sum[0] = 0;
	int n, m;
	int l;
	while(cin >> m >> n && (n || m)){
		rep(i, n){
			cin >> l;
			sum[i+1] = sum[i] + l;
		}
		int ub = INF;
		int lb = 0;
		while(ub - lb > 1){
			int mb = (ub + lb) / 2;
			int pos = 0;
			rep(i, m){
				rep2(j, pos+1, n + 1){
					if(sum[j] - sum[pos] > mb){
						pos = j-1;
						break;
					}
					if(j == n) pos = n;
				}
			}
			if(pos == n) ub = mb;
			else lb = mb;
		}
		cout << ub << endl;
	}
	return 0;
}