You are given (n) circles and two integer parameters (k) and (\ell). The (i)-th circle has radius (r_i) and (r_i \ge r_j) holds for every (1 \le i < j \le n). The task is to draw these (n) circles on a 2D plane so that the following conditions are simultaneously satisfied. Before proceeding to the conditions, let us recall that: Each circle is uniquely determined by its center (O) and radius (r). A circle of radius (r) is defined as the set of all points whose distance from its center (O) is exactly (r). All distances considered in this task are Euclidean. The interior region of a circle is defined as the set of all points whose distance from its center (O) is less than (r). We say that one circle (C) encloses another circle (C^\prime) if all points of (C^\prime) lie inside the interior region of (C). You need to draw these (n) circles to satisfy all of the following conditions: The centers of all circles are collinear. The distance between any two centers is at most (k). No two circles intersect. If a circle encloses two circles (C) and (C^\prime), then either (C) encloses (C^\prime) or (C^\prime) encloses (C). The first (\ell) circles may or may not be enclosed by other circles, whereas each of the remaining (n - \ell) circles must be enclosed by at least one circle. An arrangement that satisfies all the above conditions is called feasible . For a feasible arrangement (\mathcal{A}), define its quality (d(\mathcal{A})) as the minimum distance between any two points belonging to different circles. If there exists at least one feasible arrangement for the given case, output the maximum possible quality among all feasible arrangements. If no feasible arrangements exist, output (0). The first line contains three integers (k), (n), and (\ell), representing the maximum distance between centers, the number of circles to be d