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

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];
    }

    vector<ll> days_passes; // Store passes completed at each day
    vector<int> next_day(n, -1); // Store next day index for each index
    vector<ll> day_used(n, -1); // Store day when index is reached

    ll total_passes = 0;
    ll day = 0;
    int idx = 0;

    while (day < k) {
        if (day_used[idx] != -1) {
            // Cycle detected
            ll cycle_length = day - day_used[idx];
            ll passes_in_cycle = total_passes - days_passes[day_used[idx]];
            ll remaining_days = k - day;
            ll cycles = remaining_days / cycle_length;
            total_passes += cycles * passes_in_cycle;
            day += cycles * cycle_length;
            if (day >= k) break;
        }

        day_used[idx] = day;
        days_passes.push_back(total_passes);

        ll time_left = p;
        int start_idx = idx;

        while (time_left >= d[idx]) {
            time_left -= d[idx];
            idx = (idx + 1) % n;
            if (idx == 0) {
                total_passes++;
            }
            if (idx == start_idx && time_left < d[idx]) {
                break;
            }
        }
        day++;
    }

    cout << total_passes << endl;
}

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

    solve();

    return 0;
}