#include <bits/stdc++.h>
using namespace std;


#define pii pair<int, int>
const int ar = 1e9 + 7;
const int nmax = 1e6 + 1;
long long a[nmax], n, m, ans = 0;
bool check (long long k) {
    long long d = 0;
    for (long long i = 1; i <= m; ++i) {
        if (a[i] % k == 0) {
            d += a[i] / k;
        }
        else {
            d += a[i] / k + 1;
        }
    }
    return d <= n;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    for (long long i = 1; i <= m; ++i) cin >> a[i];
    long long l = 1, r = *max_element(a + 1, a + 1 + m);
    while (l <= r) {
        long long mid = (l + r) / 2;
        if (check(mid)) {
            ans = mid;
            r = mid - 1;
        }
        else {
            l = mid + 1;
        }
    }
    cout << ans;
    return 0;
}

#include <iostream>
using namespace std;
bool cpc(int a[], int m, int n, long long mi)
{
    long long rc = 0;
    for (int i = 0; i < m; i++)
    {
        rc += (a[i] + mi - 1) / mi;
        if (rc > n) return false;
    }
    return rc <= n;
}
int main()
{
    int n, m;
    cin >> n >> m;
    int a[m];
    long long sum = 0;
    for (int i = 0; i < m; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
    long long l = 1, r = sum, kq = r;
    while (l <= r)
    {
        long long mi = l + (r - l) / 2;
        if (cpc(a, m, n, mi))
        {
            kq = mi;
            r = mi - 1;
        }
        else
            l = mi + 1;
    }
    cout << kq << endl;
    return 0;
}

$#khanhtaon$