Easy Java Solution
IntuitionApproachComplexity

Time complexity:
O(n*m)


Space complexity:
O(1)

Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
O(n*m)

- Space complexity:
O(1)
# 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']