#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 x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


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



//* Make sure ai+1 % ai == 0 for this problem
vector<int> a;

int consistency(int n, int x){
	
	sort(begin(a), end(a), greater<int>());
	
    int ct = 0;
    for(int i=0; i<n; i++){
    	if(x==0) break;
    	ct += (x/a[i]);
    	x = x%a[i];
    }

    return ct;    
}







void solve() {
    
    int n, x;
    cin>> n >> x;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, x) << 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;
}