Wires

Given n segments of wire of length l[1], l[2], ..., l[n] centimeters. You must cut them to get k equal segments of as much length as possible, that is expressed with integer value in centimeters. If you can not get even k segments of length 1 cm, output 0.

Input

First row contains numbers n (1 ≤ n ≤ 10000) and k (1 ≤ k ≤ 10000). Next n lines contain integers l[1], l[2], ..., l[n] (100 ≤ L[i] ≤ 10^7), one number per line.

Output

Output one number - get the length of the segments.

Examples