You are given two positive integers, divisor1 and divisor2, along with two integers, uniqueCnt1 and uniqueCnt2.

You must populate two arrays, arr1 and arr2, with distinct positive integers such that:

• arr1 contains uniqueCnt1 unique integers, none of which are divisible by divisor1.

• arr2 contains uniqueCnt2 unique integers, none of which are divisible by divisor2.

• arr1 and arr2 are disjoint, meaning no integer appears in both arrays.

Return the minimum possible maximum value present across both arrays after choosing the elements optimally.

Constraints:

• $2 \leq$ divisor1, divisor2 $\leq 10^5$

• $1 \leq$ uniqueCnt1, uniqueCnt2 $< 10^9$

• $2 \leq$ uniqueCnt1 $+$ uniqueCnt2 $\leq 10^9$

Input: divisor1 = 4-int, divisor2 = 6-int, uniqueCnt1 = 3-int, uniqueCnt2 = 4-int
Output: 7-int
Explanation: The arrays can be populated with the required distinct, disjoint values while avoiding their respective divisors, and the minimum possible maximum value is 7.

Input: divisor1 = 10-int, divisor2 = 3-int, uniqueCnt1 = 5-int, uniqueCnt2 = 2-int
Output: 7-int
Explanation: The arrays can be populated with the required distinct, disjoint values while avoiding their respective divisors, and the minimum possible maximum value is 7.

Input: divisor1 = 11-int, divisor2 = 11-int, uniqueCnt1 = 1-int, uniqueCnt2 = 1-int
Output: 2-int
Explanation: Two distinct positive integers can be assigned to the arrays without either being divisible by 11, so the minimum possible maximum value is 2.

Input: divisor1 = 99999-int, divisor2 = 100000-int, uniqueCnt1 = 500000000-int, uniqueCnt2 = 400000000-int
Output: 900000000-int
Explanation: The arrays can be populated with the required distinct, disjoint values while avoiding their respective divisors, and the minimum possible maximum value is 900000000.

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.