n=Scanf_Int();
long T=Scanf_Long();
int[] a=new int[n+1];
int[] b=new int[n+1];
for (int i=1;i<=n;i++){
a[i]=Scanf_Int();
min=Math.min(min,a[i]);
}
long ans=0,z=0;
sum1=0;
while (true){
sum1=0;
if (T<min){
break;
}
ans=0;
for (int i=1;i<=n&&T>=min;i++){
if (b[i]==520){
continue;
}
if (a[i]>T){
b[i]=520;
}
else {
ans++;
sum1+=a[i];
T-=a[i];
}
}
if(sum1!=0){
z+=(T/sum1+1)*ans;
T%=sum1;}
}
out.println(z);