#include <bits/stdc++.h>
#define INT long long int
#define MOD 998244353
#define oo 6*(1e18)
using namespace std;

INT n, T, a[200020], sum, ans;
INT f(int l, int r)
{
    INT ret = 0;
    for(int i = l ; i <= r ; i++ ) ret += a[i];
    return ret;
}
int main()
{
    freopen(".25.in","r",stdin);
    freopen(".25.out","w",stdout);
    ios::sync_with_stdio(false);
    cin>>n>>T;
    for(int i = 0 ; i < n ; i++ )
        cin>>a[i];
    while( T )
    {
        INT s = f(0, n-1), p = 0, c = 0;
        ans += (T/s)*(n-count(a,a+n,0));
        T %= s;
        for(int i = 0 ; i < n ; i++ )
        {
            if( a[i] > 0 and a[i] <= T ) T-=a[i], ans++;
            else if( a[i] )
            {
                p = i;
                break;
            }
        }
        a[p] = 0;
        rotate(a, a+p, a+n);
        for(int i = 0 ; i < n ; i++ )
            if( a[i] > 0 and a[i] <= T ) c++;
            else a[i] = 0;
        if( c == 0 ) break;
    }
    cout<<ans;
}