from bisect import bisect_left, bisect_right
# bisect_left(a, x): a[i] >= xとなるような最小のi.
# 昇順ソートされたリストaに昇順を崩さずxを挿入できる位置s(0-index)を返す.
# a = [1, 3, 5, 7, 9, 11, 13, 15, 17, 19]
# s = bisect_left(a,4), s = 2


n, m, k = map(int, input().split())
a = list(map(int, input().split())) + [0]
c = []
for i in a:
    for j in a:
        if i + j <= m:
            c.append(i + j)
c = sorted(set(c))
b = []
for i in a:
    for j in c:
        if i + j <= m:
            b.append(i + j)
b = sorted(set(b))

if k == 1:
    ans = 0
    for i in a:
        if ans < i <= m:
            ans = i
    print(ans)
elif k == 2:
    print(max(c))

elif k == 3:
    print(max(b))

elif k == 4:
    ans = 0
    for i in a:
        k = bisect_left(b, m - i + 1)
        if k - 1 >= 0:
            ans = max(ans, b[k - 1] + i)
    print(ans)

elif k == 5:
    ans = 0
    for i in c:
        k = bisect_left(b, m - i + 1)
        if k - 1 >= 0:
            ans = max(ans, b[k - 1] + i)
    print(ans)


else:
    ans = 0
    for i in b:
        k = bisect_left(b, m - i + 1)
        if k - 1 >= 0:
            ans = max(ans, b[k - 1] + i)
    print(ans)