#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const int mod = 998244353;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

const int N = (int)1e5 + 1, M = N * 2;

void solve() {
    int n;
    ll p, k;
    cin >> n >> p >> k;
    vector<int> d(n);

    for (int i = 0; i < n; ++i) {
        cin >> d[i];
    }

    int idx = 0;
    ll day = 0, ps = 0, t = p;

    typedef pair<int, ll> st;

    map<st, pair<ll, ll>> mp;
    st s = {idx, t};
    mp[s] = {day, ps};

    while(day < k){
        while(t >= d[idx]){
            t -= d[idx];
            idx++;
            if (idx == n) {
                idx = 0;
                ps++;
            }
        }
  
        day++;
        t = p;
        s = {idx, t};

        if(mp.count(s)){
            ll pday = mp[s].first, prev = mp[s].second;
            ll clen = day - pday, cp = ps - prev;
            ll rem = k - day;
            ll cyc = rem / clen;
            ps += cyc * cp;
            day += cyc * clen;
        } 
        else{
            mp[s] = {day, ps};
        }
    }
    cout << ps << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
//    cin >> t;

    while(t--){
        solve();
    }

    return 0;
}