#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    int n, p, k;
    cin >> n >> p >> k;

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

        if (i)
            d[i] += d[i - 1];
    }

    ll curP = p % d[n - 1];

    auto sum = [&] (int i, int m) {
        ll cur = d[min(i + m, n - 1)] - (i ? d[i - 1] : 0);

        if (i + m >= n)
            cur += d[i + m - n];

        return cur;
    };

    int nxt[n];
    for (int i = 0; i < n; i++) {
        int l = 0, r = n - 1, m;
        while (l <= r) {
            m = (l + r) >> 1;

            if (sum(i, m) > curP)
                r = m - 1;
            else
                l = m + 1;
        }

        nxt[i] = (i + l) % n;
    }

    ll sol = (p / d[n - 1]) * k;

    int cur = 0;

    vector<int> freq(n);

    while (!freq[cur] && k) {
        k--;

        freq[cur]++;

        sol += (nxt[cur] < cur);

        cur = nxt[cur];
    }

    int st = cur;
    ll re = 0, cst = 0;

    do {
        re += (nxt[cur] < cur);

        cur = nxt[cur];

        cst++;
    } while (st != cur);

    sol += 1LL * (k / cst) * re;

    k %= cst;

    while (k--)
        re += (nxt[cur] < cur), cur = nxt[cur];

    cout << sol;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}