import sys
sys.setrecursionlimit(1000000000)

#
# Solution Template for Discount Destinations
# 
# Australian Informatics Olympiad 2026
# 
# This file is provided to assist with reading of input and writing of output
# for the problem. You may modify this file however you wish, or
# you may choose not to use this file at all.
#

# N is the number of travel days.
N = 0
# K is the window length and D is its spending cap.
K = 0
D = 0
# A contains the undiscounted daily costs. The list starts from 0.
A = []

# Read N, K, D, and the daily costs.
N, K, D = map(int, input().strip().split())
A = list(map(int, input().strip().split()))

# TODO: Compute the total amount actually paid and store it in answer.
answer = 0

# Write the answer.
print(answer)