#include <iostream>
#include <vector>
#include <math.h>

using namespace std;
static int answer = 0;
int binary(int start, int end, vector<long> &a, int &n, int &k) {
    int middle = (start + end) / 2;
    int sum = 0;
    if (middle != 0) {

        for (int i = 0; i < n; i++) {
        //    sum = sum + a[i] / middle;
        }
        if (sum > k) {
            return binary(middle + 1, end, a, n, k);
        } else if (sum < k) {
            return binary(start, middle - 1, a, n, k);
        } else {
            answer = middle;
            return binary(middle+1, end, a, n, k);
        }
    } else {
        for (int i = 0; i < n; i++) {
            sum = sum + a[i] / 1;
        }
        if(sum==k){
            return 1;
        } else{
            cout<<0;
            exit(0);
        }
    }
}

int main() {
    int n, k;
    cin >> n >> k;
    vector<long> a(n);
    cin >> a[0];
    int max = a[0];
    for (int i = 1; i < n; i++) {
        cin >> a[i];
        if (a[i] > max) {
            max = a[i];
        }
    }
    binary(0, max, a, n, k);


    cout << answer;
    return 0;
}