def main(): import sys N, M, K = map(int, sys.stdin.readline().split()) A = list(map(int, sys.stdin.readline().split())) if N > 0 else [] if N == 0: print(0) return # Sort A in descending order to easily pick the maximum possible value sorted_A = sorted(A, reverse=True) def dfs(remaining, current_sum): if remaining == 0: return current_sum max_val = current_sum # Option to stop drawing # Find the maximum a that can be added without exceeding M max_a = None for a in sorted_A: if current_sum + a <= M: max_a = a break if max_a is not None: next_sum = current_sum + max_a candidate = dfs(remaining - 1, next_sum) if candidate > max_val: max_val = candidate return max_val result = dfs(K, 0) print(result) if __name__ == '__main__': main()