JAVA Solution
IntuitionApproachComplexity
Time complexity:
o(n2)
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:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
o(n2)

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
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']