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

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define repo(i, b) for (int i = 0; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, long long> pii;
typedef vector<int> vi;

ll solve() {
  // input
  int n;  // num of players
  int p;  // day length
  int k;  // num of days
  cin >> n >> p >> k;
  vi a(n);  // players

  for (auto& i : a) cin >> i;

  vi cuma = [&]() -> vi {
    vi cum;
    cum.push_back(0);
    int repeat = 2;
    while (repeat--) {
      for (int i : a) {
        cum.push_back(cum[sz(cum) - 1] + i);
      }
    }
    return cum;
  }();

  // [starting] = <where you end up, number of players>
  vector<pii> to = [&]() {
    vector<pii> to;
    ll sum = a[0];

    for (int left = 0; left < n; left++) {
      ll lo = 0, diff = (1LL) << 34LL;
      while (diff > 0) {
        auto check = [&](ll x) {
          ll ans = (x / n) * cuma[n];
          ans += cuma[left + (x % n)] - cuma[left];
          return ans <= p;
        };
        if (check(lo + diff)) {
          lo += diff;
        }
        diff /= 2;
      }

      to.emplace_back((left + lo) % n, lo);
      sum -= a[left];
    }
    return to;
  }();

  pii loop;
  // [after i days] = <next index to play, number of students to play total>
  vector<pii> cum = [&]() {
    vector<pii> cum;
    vector<int> vist(n, -1);
    pii cur(0, 0);

    cum.push_back(cur);
    while (vist[cur.first] == -1) {
      vist[cur.first] = (int)cum.size() - 1;
      cur.second += to[cur.first].second;
      cur.first = to[cur.first].first;

      cum.push_back(cur);
    }
    loop = make_pair(vist[cur.first], cum.size() - 1);
    return cum;
  }();

  auto ans = [&]() {
    // no loop
    if (k < (int)cum.size() - 1) {
      return cum[k].second / n;
    }
    ll ans = cum[cum.size() - 1].second;
    k -= (int)cum.size() - 1;
    ll loopVal = cum[loop.second].second - cum[loop.first].second;
    ll loopSize = loop.second - loop.first;
    ans += loopVal * (k / loopSize);
    ans += cum[loop.first + (k % loopSize)].second - cum[loop.first].second;
    return ans / n;
  }();

  return ans;
  // <size of loop, num of students in loop>
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  cout << solve();
  return 0;
}