Labor

/*
    Task    : _example
    Author  : Phumipat C. [MAGCARI]
    Language: C++
    Created : 16 January 2023 [21:52]
*/
#include<bits/stdc++.h>
using namespace std;
long long t[1000010];
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    long long m,n,mx = 0;
    cin >> m >> n;
    for(int i=1;i<=m;i++)
        cin >> t[i],mx = max(mx,t[i]);
    long long l=1,r=n*mx,mid,cnt;
    while(l<r){
        mid = (l+r)/2;
        // assume we have "mid" time
        cnt = 0;
        for(int i=1;i<=m;i++){
            cnt+=(mid/t[i]);
            if(cnt >= n)    break;
        }
        if(cnt >= n)    r = mid;
        else            l = mid+1;
    }
    cout << l << '\n';
    return 0;
}