#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll n, p, k; cin >> n >> p >> k;
	vector<ll> a(n); for (int i = 0; i < n; i ++) cin >> a[i];
	vector<ll> pf(n + 1);
	for (int i = 1; i <= n; i ++) pf[i] = pf[i - 1] + a[i - 1];
	ll sum = pf.back();
	ll ans = (p / sum) * k;
	p %= sum;
	auto getnxt = [&](ll cur){
		ll idx = upper_bound(pf.begin(), pf.end(), pf[cur] + p) - pf.begin();
		if (idx == n + 1){
			ll rem = p - (sum - pf[cur]);
			ll nidx = upper_bound(pf.begin(), pf.end(), rem) - pf.begin();
			return make_pair(nidx - 1, 1);
		} else{
			return make_pair(idx - 1, 0);
		}
	};
	// for (int i = 0; i < n; i ++) cout << getnxt(i).se << ' ';
	// cout << '\n';
	map<ll, pl> prv;
	ll curstu = 0, curround = 0, curday = 0;
	prv[0] = {curday, curround};
	bool enter = false;
	while(k){
		pl add = getnxt(curstu);
		curstu = add.fi;
		curday ++;
		curround += add.se;
		ans += add.se;
		k --;
		if (! enter && prv.count(curstu)){
			//debug(curround - prv[curstu].se);
			ans += (curround - prv[curstu].se) * (k / (curday - prv[curstu].fi));
			k %= curday - prv[curstu].fi;
			enter = true;
		}
		prv[add.fi] = {curday, curround};
	}
	cout << ans << '\n';
}