You are given two prime numbers primeOne and primeTwo.

There is an infinite supply of coins having denominations primeOne and primeTwo. An item with price $x$ can be bought if there exist non negative integers $a$ and $b$ such that $a \cdot$ primeOne $+ b \cdot$ primeTwo $= x$.

Return the maximum price of an item that cannot be bought.

Constraints:

• $1 <$ primeOne, primeTwo $< 10^4$

• primeOne and primeTwo are prime numbers.

• primeOne $\cdot$ primeTwo $< 10^5$

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.