#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n,k,a[100000],i,maxim,st,dr,mid,pos,aux;
long long suma,lsuma;
int main(){
    ifstream fin("grupuri.in");
    ofstream fout("grupuri.out");
    fin>>k>>n;
    for(i=0;i<n;i++){
        fin>>a[i];
        suma+=a[i];
    }
    maxim=suma/k; lsuma=-1; pos=n;
    while(suma!=lsuma){
        st=0; dr=n-1; aux=pos;
        lsuma=suma;
        while(st<=dr){
            mid=(st+dr)/2;
            if(a[mid]>=maxim){
                dr=mid-1;
                pos=mid;
            }else{
                st=mid+1;
            }
        }
        k=k-(aux-pos);
        suma=0;
        for(i=0;i<pos;i++){
            suma+=a[i];
        }
        if(k!=0)    maxim=suma/k;
        else{
            break;
        }
    }
    fout<<maxim;
    fin.close();
    fout.close();
    return 0;
}