magic

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <assert.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
const int INF = 1000000000;
const int prime = 9241;
const ld pi = acos(-1.);

ll t[100005];
int main()
{
   int n,m;
   cin >> n >> m;
   for (int i = 0; i < n; i++) cin >> t[i];
   ll lb = 1;
   ll rb = (ll)1e18;
   ll ans = -1;
   while (lb <= rb)
   {
       ll mid = (lb+rb)>>1;
       ll cnt = 0ll;
       for (int i = 0; i < n; i++) cnt += mid / t[i];
       if (cnt >= (ll)m)
       {
           ans = mid;
           rb = mid-1;
       } else lb = mid + 1;
   }
   assert(ans != -1ll);
   cout << ans << endl;
   return 0;
}