#include <cstdio>
#define NMAX 100010
using namespace std;

long N, K, sum, A[NMAX];

long solve(long N, long sum, long K)
{
	if(N < 1 || K <= 0)
		return 0;
	if(A[N] <= sum / K)
		return sum / K;
	return solve(N - 1, sum - A[N], K - 1);
}

int main(void)
{
	FILE *f = fopen("grupuri.in", "r"), *g = fopen("grupuri.out", "w");
	fscanf(f, "%d%d", &K, &N);
	for(int i = 1; i <= N; ++i)
		fscanf(f, "%ld", &A[i]), sum += A[i];
	
	fprintf(g, "%ld", solve(N, sum, K));
	
	fclose(f);
	fclose(g);
	return 0;
}