#include <stdio.h>
#include <math.h>

int n, k, a[10001];

long Solve(int n, long sum, int k)
{
     if (n < 0 || k <= 0) return 0;
     if (a[n] <= sum / (long)k) return sum / (long)k;
     
     return Solve(n-1, sum-a[n], k-1);
}

int main()
{
    int i;
    long sum = 0;
    
    freopen("grupuri.in", "r", stdin);
    freopen("grupuri.out", "w", stdout);
    
    scanf("%d %d", &k, &n);
    
    for (i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
        sum += (long)a[i];
    }
    
    printf("%ld\n", Solve(n-1, sum, k));
    return 0;
}