    #require 'pp'
#    require 'set'
     
    class PriorityQueue
        def initialize(array = [])
          @data = []
          array.each{|a| push(a)}
        end
      
        def push(element)
          @data.push(element)
          bottom_up
        end
      
        def pop
          if size == 0
            return nil
          elsif size == 1
            return @data.pop
          else
            min = @data[0]
            @data[0] = @data.pop
            top_down
            return min
          end
        end
      
        private
      
        def swap(i, j)
          @data[i], @data[j] = @data[j], @data[i]
        end
      
        def size
          @data.size
        end
      
        def parent_idx(target_idx)
          (target_idx - (target_idx.even? ? 2 : 1)) / 2
        end
      
        def bottom_up
          target_idx = size - 1
          return if target_idx == 0
          parent_idx = parent_idx(target_idx)
          while (@data[parent_idx][0] > @data[target_idx][0])
            swap(parent_idx, target_idx)
            target_idx = parent_idx
            break if target_idx == 0
            parent_idx = parent_idx(target_idx)
          end
        end
      
        def top_down
          target_idx = 0
      
          # child がある場合
          while (has_child?(target_idx))
      
            a = left_child_idx(target_idx)
            b = right_child_idx(target_idx)
      
            if @data[b].nil?
              c = a
            else
              c = @data[a][0] <= @data[b][0] ? a : b
            end
      
            if @data[target_idx][0] > @data[c][0]
              swap(target_idx, c)
              target_idx = c
            else
              return
            end
          end
        end
      
        # @param Integer
        # @return Integer
        def left_child_idx(idx)
          (idx * 2) + 1
        end
      
        # @param Integer
        # @return Integer
        def right_child_idx(idx)
          (idx * 2) + 2
        end
      
        # @param Integer
        # @return Boolent
        def has_child?(idx)
          ((idx * 2) + 1) < @data.size
        end
    end
     
    n, k = gets.split.map(&:to_i)
    a_n = gets.split.map(&:to_i)
    pq = PriorityQueue.new(a_n.map {|a| [-a.to_f, a, 1] })
     
    #pp pq
     
    k.times do |i|
        #pp pq
        x, orig, cnt = pq.pop
        cnt += 1
        x2 = orig.to_f / cnt
        pq.push([-x2, orig, cnt])
     
        #pp ordered
    end
     
    x = pq.pop
    puts -x.first.floor
