You are given an integer array nums representing target values and an integer space.

Choosing a seed value nums[i] allows you to destroy every target in nums that can be expressed as nums[i] + c * space, where c $\geq 0$ is any non negative integer.

Return the minimum value of nums[i] that destroys the maximum possible number of targets.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• $1 \leq$ space $\leq 10^9$

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.