#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 100;
int n;
ll k;
ll a[maxn];
int main() {
    cin >> n >> k;

    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    ll L = 0, R = 1e18;
    ll res = 1e18;
    while(L <= R) {
        ll middle = (L + R) / 2;

        ll sum = 0;
        for(int i = 0; i < n; i++) {
            sum += middle / a[i];
        }
        if(sum >= k) {
            res = min(res, middle);
            R = middle - 1;
        }
        else {
            L = middle + 1;
        }


    }
    cout << res << endl;
    return 0;
}