#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;

struct pair_hash {
    template<class T1, class T2>
    size_t operator()(const std::pair<T1, T2> &pair) const {
        return hash<T1>()(pair.first) ^ hash<T2>()(pair.second);
    }
};

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;

int n;
int day_time;
int total_days;
int total_time;
int total_training_time = 0;

vector<int> a;

void solve() {
    cin >> n >> day_time >> total_days;
    a.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<int> cnt(n), nxt(n);
    for (int pos = 0; pos < n; ++pos) {
        int rem = day_time;
        int curr = pos;
        int c = 0;
        while (rem >= a[curr]) {
            rem -= a[curr];
            curr = (curr + 1) % n;
            c += 1;
        }
        cnt[pos] = c;
        nxt[pos] = curr;
    }

    unordered_map<int, pair<int, ll>> mp; // pos -> (day, total_perf)
    int pos = 0;
    ll total_perf = 0;
    int day = 0;

    while (day < total_days) {
        if (mp.find(pos) != mp.end()) {
            // Cycle detected
            int prev_day = mp[pos].first;
            ll prev_perf = mp[pos].second;
            int cycle_days = day - prev_day;
            ll cycle_perf = total_perf - prev_perf;
            ll cycles = (total_days - day) / cycle_days;
            total_perf += cycles * cycle_perf;
            day += cycles * cycle_days;
            if (day >= total_days)
                break;
        }
        mp[pos] = {day, total_perf};
        total_perf += cnt[pos];
        pos = nxt[pos];
        day += 1;
    }

    ll full_passes = total_perf / n;
    cout << full_passes << endl;
}

int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);

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

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

    solve();

    return 0;
}