Beginner Friendly
Easiest Approach100%Complexity
Time complexity:O(n^2)

Space complexity:O(1)
Code

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

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

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

- Space complexity:O(1)
<!-- 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]%(k*nums2[j])==0)
                count++;
            }
        }
        return count;
    }
}
please UPVOTE
```
['Java']