#include <iostream>
#include <fstream>

using namespace std;

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

long long n, k, a[100001];

int main()
{
    fin >> k >> n;

    long long suma = 0;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
        suma += a[i];
    }

    long long st = 1;
    long long dr = suma;
    long long sol = 1;
    while(st <= dr){
        long long mij = (st + dr) / 2;

        long long sum = 0;
        for(int i = 1; i <= n; i++){
            sum += min(a[i], k);
        }
        if(sum >= mij * k){
            sol = mij;
            st = mij + 1;
        }
        else{
            dr = mij - 1;
        }
    }
    fout << sol;

    return 0;
}