Minimum Enclosing Circle Radius

This problem requires you to determine the minimum radius of a circle that can enclose all specified checkpoints, under the assumption that all checkpoints lie exactly on the boundary of a given circular track. You are given an integer \(n\) representing the number of checkpoints, an integer \(r\) representing the radius of the circular track, followed by \(n\) lines with the coordinates \((x_i, y_i)\) of each checkpoint.

Since all checkpoints lie on the circle's perimeter, the radius of the minimum enclosing circle is exactly \(r\). Your task is to simply output the value \(r\), which is guaranteed to cover all the checkpoints.

inputFormat

The first line contains two space-separated integers: \(n\) (the number of checkpoints) and \(r\) (the radius of the circular track). Each of the next \(n\) lines contains two integers representing the x and y coordinates of a checkpoint.

outputFormat

Output a single integer which is the radius of the minimum enclosing circle.

1 10
10 0

10