You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the $i^{ ext{th}}$ spell and potions[j] represents the strength of the $j^{ ext{th}}$ potion.

You are also given an integer success. A spell and potion pair is considered successful if the product of their strengths is at least success.

Return an integer array pairs of length n where pairs[i] is the number of potions that will form a successful pair with the $i^{ ext{th}}$ spell.

Constraints:

• n $==$ spells.length

• m $==$ potions.length

• $1 \leq$ n, m $\leq 10^5$

• $1 \leq$ spells[i], potions[i] $\leq 10^5$

• $1 \leq$ success $\leq 10^{10}$

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.