Simple solution - beats 100%🔥
Complexity
Time complexity: O(N * N)

Space complexity: O(N)
Code
# Complexity
- Time complexity: O(N * N)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity: O(N)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int numberOfPairs(int[] nums1, int[] nums2, int k) {
        int count = 0;
        for (int i = 0; i < nums1.length; i++) {
            for (int j = 0; j < nums2.length; j++) {
                if (nums1[i] % (nums2[j] * k) == 0) count++;
            }
        }
        return count;
    }
}
```
['Java']