#include <bits/stdc++.h>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
long long n,i,m,v[100010],mij,st,dr,x,nr;
long long s;
int verif()
{
    long long i=1,alts=0;
    while(v[i]<=mij && i<=n)
        alts+=v[i] , i++;
    if(i<=n)
        alts=alts+(n-i+1)*mij;
    return (alts>=mij*m);
}
int main()
{
    fin>>m>>n;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        s=s+v[i];
    }
    st=1;
    dr=s;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        x=verif();
        if(x==1)
            st=mij+1 , nr=mij;
        else dr=mij-1;
    }
    fout<<nr;
    return 0;
}