Given segments of wire of length l_1, l_2, \ldots, l_n centimeters. You must cut them to get equal segments of the maximum possible length, which must be an integer value in centimeters. If you cannot get even segments of length cm, output .
The first row contains the numbers (1 \leq n \leq 10000) and (1 \leq k \leq 10000). The next lines each contain an integer l_i (100 \leq l_i \leq 10^{7}), one number per line.
Output one number --- the maximum possible length of the segments.
Example 1