## https://yukicoder.me/problems/no/2329


def main():
    N, M, K = map(int, input().split())
    A = list(map(int, input().split()))

    if K == 1:
        answer = 0
        for a in A:
            if a <= M:
                answer = max(answer, a)
        print(answer)
        return
    
    k1 = K // 2
    k2 = K - k1

    # k1パート
    
    def dfs(A, M, a_set, a, k1):
        if k1 == 0:
            if a <= M:
                a_set.add(a)
            return
        
        for x in A:
            dfs(A, M, a_set, a + x, k1 - 1)
        

    A = [0] + A
    a_set = set()
    dfs(A, M, a_set, 0, k1)
    b_set = set()
    dfs(A, M, b_set, 0, k2)

    b_array = list(b_set)
    b_array.sort()

    answer = 0
    for a in a_set:
        m = M - a
        if len(b_array) == 0:
            continue

        if b_array[0] > m:
            continue

        low = 0
        high = len(b_array) - 1
        while high - low > 1:
            mid  =(high + low) //2
            if b_array[mid] <= m:
                low = mid

            else:
                high = mid
        if b_array[high] <= m:
            ans = b_array[high] + a
        else:
            ans = b_array[low] + a
        
        answer = max(answer, ans)
    print(answer)
        

    




if __name__ == "__main__":
    main()