// infoarena: problema/grupuri //
#include <fstream>
#define MAXN 100010
using namespace std;

ifstream in("grupuri.in");
ofstream out("grupuri.out");

long long a[MAXN],i,j,k,n,sum;

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

int main()
{
	in>>k>>n;
	for(i=1; i<=n; i++)
		in>>i[a], sum+=a[i];
	
	out<<solve(n-1, sum, k);
	
	return 0;
}