Problem:
Problem I: Beautiful Spacing

Text is a sequence of words, and a word consists of characters. Your task is to put words into a grid with W columns and sufficiently many lines. For the beauty of the layout, the following conditions have to be satisfied.

The words in the text must be placed keeping their original order. The following figures show correct and incorrect layout examples for a 4 word text "This is a pen" into 11 columns.

Figure I.1: A good layout.

Figure I.2: BAD | Do not reorder words.

Between two words adjacent in the same line, you must place at least one space character. You sometimes have to put more than one space in order to meet other conditions.

Figure I.3: BAD | Words must be separated by spaces.

A word must occupy the same number of consecutive columns as the number of characters in it. You cannot break a single word into two or more by breaking it into lines or by inserting spaces.

Figure I.4: BAD | Characters in a single word must be contiguous.

The text must be justified to the both sides. That is, the first word of a line must startfrom the first column of the line, and except the last line, the last word of a line must end at the last column.

Figure I.5: BAD | Lines must be justi ed to both the left and the right sides.

The text is the most beautifully laid out when there is no unnecessarily long spaces. For instance, the layout in Figure I.6 has at most 2 contiguous spaces, which is more beautiful than that in Figure I.1, having 3 contiguous spaces. Given an input text and the number of columns, please find a layout such that the length of the longest contiguous spaces between words is minimum.

Figure I.6: A good and the most beautiful layout.

Input

The input consists of multiple datasets, each in the following format.

    W N

    x1 x2 ... xN

W, N, and xi are all integers. W is the number of columns (3 ≤ W ≤ 80,000). N is the number of words (2 ≤ N ≤ 50,000). xi is the number of characters in the i-th word (1 ≤ xi ≤ (W−1)/2 ). Note that the upper bound on xi assures that there always exists a layout satisfying the conditions.

The last dataset is followed by a line containing two zeros.

Output

For each dataset, print the smallest possible number of the longest contiguous spaces between words.

Sample Input

11 4
4 2 1 3
5 7
1 1 1 2 2 1 2
11 7
3 1 3 1 3 3 4
100 3
30 30 39
30 3
2 5 3
0 0

Output for the Sample Input

2
1
2
40
1

Solution in C++11 (judge verdict: Accepted)

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define TIMES(i, n) for(int i = 0; i < (n); ++i)

template<class Pred>
int binsearch(const Pred &pred) {
    int val = 0;
    for(int bit = 17; bit >= 0; --bit) {
        const int next = val + (1<<bit);
        val = pred(next) ? next : val;
    }
    return val;
}

bool solve() {
    int W, N;
    scanf("%d %d", &W, &N);
    if(!W && !N) return false;

    vector<long long> sum(N+2, 0);
    TIMES(i, N) {
        int v;
        scanf("%d", &v);
        sum[i+1] = v;
        sum[i+1] += sum[i];
    }
    sum[N+1] = sum[N];

    vector<int> dp(N+3, 0);
    int ans = binsearch([&](long long x) {
        if(x > W) return false;
        fill(dp.begin(), dp.end(), 0);
        dp[N+2] = 0;
        dp[N+1] = 1;
        for(int i = N; i > 0; --i) {
            const int mink = binsearch([&](int k) {
                if(i+k > N) return false;
                const long long len = (sum[i+k] - sum[i-1]) + k*x;
                return len < W;
            }) + 2;
            const int maxk = binsearch([&](int k) {
                if(i+k > N) return false;
                const long long len = (sum[i+k] - sum[i-1]) + k;
                return len <= W;
            }) + 1;
            //cout << x << ' ' << i << ' ' << mink << ' ' << maxk << endl;
            dp[i] = (i+maxk == N+1) || (mink <= maxk && dp[i+mink] - dp[i+maxk+1] > 0);
            //cout << dp[i] << endl;
            dp[i] += dp[i+1];
        }
        return dp[1] - dp[2] == 0;
    }) + 1;
    printf("%d\n", ans);
    return true;
}

int main() {
    while(solve()) ;
    return 0;
}