N, M, K = gets.split.map(&:to_i)
A = gets.split.map(&:to_i)

memo = Hash.new { |h, k| h[k] = {} }
memo[0][0] = true

A.each do |a|
  3.times do |i|
    memo[i].keys.each do |k|
      memo[i + 1][k + a] = true
    end
  end
end

values = Array.new(4)
values[0] = [0]
values[1] = memo[1].keys.sort
values[2] = memo[2].keys.sort
values[3] = memo[3].keys.sort
values[0] << Float::INFINITY
values[1] << Float::INFINITY
values[2] << Float::INFINITY
values[3] << Float::INFINITY

ans = 0

1.upto(K) do |k|
  if k <= 3
    idx = values[k].bsearch_index { |x| x > M }

    if idx > 0
      v = values[k][idx - 1]

      if ans < v
        ans = v
      end
    end
  else
    a = 3
    b = k - a

    values[a].each do |v1|
      if ans < v1 && v1 <= M
        ans = v1
      end

      r = M - v1
      next if r <= 0

      idx = values[b].bsearch_index { |x| x > r }

      if idx > 0
        v2 = values[b][idx - 1]
        v = v1 + v2

        if ans < v && v <= M
          ans = v
        end
      else
        v2 = values[b][idx]
        v = v1 + v2

        if ans < v && v <= M
          ans = v
        end
      end
    end
  end
end

puts ans