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

long n, k, a[100001];

long solve(long n, long sum, long 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()
{
  long i, sum=0;
  freopen("grupuri.in","r",stdin);
  freopen("grupuri.out","w",stdout);
  scanf ("%ld%ld",&k,&n);
  for (i=0; i<n; i++)
    {
      scanf("%ld",&a[i]); sum+=(long)a[i];
    }
  printf("%ld\n",solve(n-1,sum,k));
  return 0;
}