Vanya walks late at night along a straight street of length *l*, lit by *n* lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point *l*. Then the *i*-th lantern is at the point *a*_{i}. The lantern lights all points of the street that are at the distance of at most *d* from it, where *d* is some positive number, common for all lanterns.

Vanya wonders: what is the minimum light radius *d* should the lanterns have to light the whole street?

The first line contains two integers *n*, *l* (1 ≤ *n* ≤ 1000, 1 ≤ *l* ≤ 10^{9}) — the number of lanterns and the length of the street respectively.

The next line contains *n* integers *a*_{i} (0 ≤ *a*_{i} ≤ *l*). Multiple lanterns can be located at the same point. The lanterns may be located at the ends of the street.

提交代码