You are given an array towers where towers[i] = [$x_i$, $y_i$, $q_i$] denotes the location $($$x_i$, $y_i$$)$ and the network quality $q_i$ of the $i^{ ext{th}}$ tower. You are also given an integer radius.

The network quality contribution of tower $i$ to an integral coordinate $(x, y)$ is calculated as $\lfloor \frac{q_i}{1 + d} \rfloor$, where $d$ is the Euclidean distance between $(x, y)$ and $($$x_i$, $y_i$$)$, provided that $d \le$ radius. If $d >$ radius, the tower provides no quality to that coordinate.

The total network quality at coordinate $(x, y)$ is the sum of the quality contributions from all towers within distance radius.

Return the integral coordinate $[x, y]$ with $x \ge 0$ and $y \ge 0$ that achieves the maximum total network quality. If multiple coordinates share the same maximum quality, return the lexicographically smallest coordinate.

Note: A coordinate $(x_1, y_1)$ is lexicographically smaller than $(x_2, y_2)$ if $x_1 < x_2$, or if $x_1 = x_2$ and $y_1 < y_2$. The floor function $\lfloor val \rfloor$ rounds $val$ down to the nearest integer.

Constraints:

• $1 \leq$ towers.length $\leq 50$

• towers[i].length $= 3$

• $0 \leq x_i, y_i, q_i \leq 50$

• $1 \leq$ radius $\leq 50$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.