#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;
int n,s,cnt,sol;
long long int niz[100005];
int main(){

    freopen("coins.in","r",stdin);
    freopen("coins.out","w",stdout);

    scanf("%d %d", &n,&s);
    niz[1]=1;
    for(int i=2;i<=n+1;i++) scanf("%lld", &niz[i]);;
    for(int i=2;i<=n+1;i++){
        niz[i]=niz[i]*niz[i-1];
        if(niz[i]>1e9){
            n=i;
            break;
        }
    }

    sol=1e9;

    for(int i=n+1;i>=1;i--){
        if(niz[i]>s) continue;
        else{
            cnt=cnt+s/niz[i];
            s=s%niz[i];
        }
        if(s==0) break;
    }


    sol=min(sol,cnt);

    printf("%d\n", sol);

    return 0;
}