#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, b;
  cin >> n >> b;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  vector<int> s;
  for (int i = 0; i < n - 1; i++) {
    if (arr[i] <= b) {
      int m = INT_MIN;
      for (int j = i + 1; j < n; j++) m = max(m, arr[j]);
      if (arr[i] < m) s.push_back(b + (m - arr[i]) * (b / arr[i]));
    }
  }
  if (!s.empty())
    cout << *max_element(s.begin(), s.end()) << endl;
  else
    cout << b << endl;
  return 0;
}
