import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')

N,M,K=map(int,readline().split())
A=list(map(int,readline().split()))
se=set()
for tpl in itertools.product(A,repeat=K//2):
    for i in range(K//2+1):
        se.add(sum(tpl[:i]))
lst=list(se)
lst.sort()
ans=0
se=set()
for tpl in itertools.product(A,repeat=K-K//2):
    for i in range((K-K//2)+1):
        a=sum(tpl[:i])
        se.add(a)
for a in se:
    i=bisect.bisect_right(lst,M-a)
    if i:
        ans=max(ans,a+lst[i-1])
print(ans)