Simple brute force implementation (BEATS 100%)
Complexity
Time complexity:

Space complexity:
Code

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

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

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