#include <cstdio>
using namespace std;
int v[100005],i,n,k;
long long S;
bool verif(long long x)
{
    long long S=0;
    for (i=1;i<=n;i++)
    {
        if (v[i]<x) S+=v[i];
        else
        {
            S+=x*(n-i+1);
            if (S/k>=x) return 1;
            return 0;
        }
    }
    if (S/k>=x) return 1;
    return 0;
}
int main()
{
    freopen("grupuri.in","r",stdin );
    freopen("grupuri.out","w",stdout);
    scanf("%d %d",&k,&n);
    for (i=1;i<=n;i++) scanf("%d",&v[i]),S+=v[i];
    long long L=0,R=S/k,best;
    while (L<=R)
    {
        long long M=(L+R)>>1;
        if (verif(M)) best=M,L=M+1;
        else R=M-1;
    }
    printf("%lld",best);
    return 0;
}