def main():
    n_str, p_str, k_str = input().split()
    n = int(n_str)
    p = int(p_str)
    k = int(k_str)
    d = []
    for _ in range(n):
        d.append(int(input()))

    passes_completed = [0] * n
    next_starting_student = [0] * n

    # Precompute passes_completed and next_starting_student for each starting student
    for s in range(n):
        time = 0
        passes = 0
        current_student = s
        while True:
            time += d[current_student]
            if time > p:
                next_starting_student[s] = current_student
                passes_completed[s] = passes
                break
            if current_student == n - 1:
                passes += 1
                current_student = 0
            else:
                current_student += 1

    total_passes = 0
    day = 0
    current_start = 0
    seen = {}
    passes_at_day = []
    while day < k:
        if current_start in seen:
            # Cycle detected
            first_day = seen[current_start]
            cycle_length = day - first_day
            total_passes_in_cycle = total_passes - passes_at_day[first_day]
            remaining_days = k - day
            num_cycles = remaining_days // cycle_length
            total_passes += num_cycles * total_passes_in_cycle
            day += num_cycles * cycle_length
            # Now simulate the remaining days one by one
            while day < k:
                seen[current_start] = day
                passes_at_day.append(total_passes)
                total_passes += passes_completed[current_start]
                current_start = next_starting_student[current_start]
                day += 1
            break
        else:
            seen[current_start] = day
            passes_at_day.append(total_passes)
            total_passes += passes_completed[current_start]
            current_start = next_starting_student[current_start]
            day += 1
    print(total_passes)

main()