You are given two integer arrays nums1 and nums2 of lengths n and m respectively, and a positive integer k.

A pair (i, j) is defined as good if $0 \leq i < n$, $0 \leq j < m$, and nums1[i] is divisible by nums2[j] $ imes$ k.

Return the total count of good pairs.

Constraints:

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

• $1 \leq$ nums1[i], nums2[j] $\leq 10^6$

• $1 \leq$ k $\leq 10^3$

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.