END { load __FILE__ unless $stdin.eof? }

n, k = gets.split.map!(&:to_i)
a    = gets.split.map!(&:to_i).sort!

s = 1
k = k - (s - 1) * n
a.map! { |a| [a.quo(s), s] }

k.times do
  x, y = a.pop
  x = x * y / (y + 1)
  y = y + 1
  i = a.bsearch_index { |xi, yi| xi >= x } || n - 1
  a.insert(i, [x, y])
end

puts a.pop[0].ceil
