#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <time.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef int ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=1e+5 + 1;
const ut INF=1<<30;
const ld eps=1e-6;
const LL mod=1e+9 + 7;

int main() {
	int m, n;
	while(cin >> m >> n && m){
		int books[128];
		REP(i,n){
			cin >> books[i];
		}
		int lb = 0, ub = INF;
		while(ub - lb > 1){
			int mid = (lb + ub) / 2;
			bool ok = true;
			int now = 1, put = 0;
			REP(i,n){
				if(books[i] > mid){
					ok = false;
					break;
				}
				if(put + books[i] <= mid){
					put += books[i];
				}
				else{
					put = books[i];
					now++;
				}
				if(now > m){
					ok = false;
					break;
				}
			}
			if(ok){
				ub = mid;
			}
			else{
				lb = mid;
			}
		}
		cout << ub << endl;
	}
	return 0;
}