#!/usr/bin/env ruby

require 'set'

class Hash
  def push(key, value)
    self[key] = [] if self[key] == nil
    self[key].push(value)
  end
end

class Array
  def lower_bound(value)
    left = -1;
    right = self.length;
    while left + 1 < right
      mid = left + (right - left) / 2;
      if self[mid] >= value
        right = mid
      else
        left = mid
      end
    end
    right
  end

  def unique
    res = [self.first]
    each_cons(2) do |a, b|
      if a != b
        res.push(b)
      end
    end
    res
  end
end

def get_ints
  gets.chomp.split.map(&:to_i)
end

def get_ints_minus_one
  get_ints.map { |x| x - 1 }
end

def get_int
  gets.chomp.to_i
end

require 'bigdecimal'

N, K = get_ints
A = get_ints

ax = A.sort.map do |a|
  {
    value: BigDecimal(a),
    divided: 1,
    first: BigDecimal(a),
  }
end

count = 0
while count < K
  last = ax.pop
  value = last[:first] / (last[:divided] + 1)
  next_value = {
    value: value,
    divided: last[:divided] + 1,
    first: last[:first]
  }
  index = ax.bsearch_index { |a| a[:value] >= next_value[:value] }
  ax.insert(index, next_value)
  count += 1
  # p ax.map { |a| {value: a[:value].to_f, divided: a[:divided], first: a[:first].to_f} }
end

puts ax.last[:value].ceil
