#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}



//_ ***************************** START Below *******************************

// 3 7
// 3 2 5



vector<int> a;


bool isPossible(int n, int k, int mid){
    int p = 0;
    for(int i=0; i<n; i++){
        p += (mid/a[i]);
        
        //_ Stop early to pkrevent overflow 
        if(p >= k) return true;
    }

    return p>=k;
}


int consistency1(int n, int k){
	
	int mini = LINF;
	for(int i=0; i<n; i++) mini = min(mini, a[i]);

    int s = mini, e = k*mini;
    int ans = LINF;

    while(s<=e){
        int mid = s + (e-s)/2;
        if(isPossible(n, k, mid)){
            ans = min(ans, mid);
            e = mid-1;
        }
        else s = mid+1;
    }

    return ans;

}




int consistency2(int n, int k){
	
	int mini = LINF;
	for(int i=0; i<n; i++) mini = min(mini, a[i]);
	
	int s = mini;
	int e = k*mini;
	
	while(s<e){
		int mid = s + (e-s)/2;
		if(isPossible(n, k, mid)){
			e = mid;
		}
		else s = mid+1;
	}
	
	return e;

}









int practice(int n, int k){


}





void solve() {
    
    int n, k;
    cin>>n >> k;
    
    a.resize(n);
    
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency2(n, k) << endl;
    // cout << consistency2(n, k) << " -> " << practice(n,k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}