Most Easy Python Solution[Beats 100%]
IntuitionApproachComplexity
Time complexity:

Space complexity:
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)$$ -->

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

# Code
```python3 []
class Solution:
    def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:
        nums1=list(filter(lambda x: x%k==0, nums1))
        count=0
        for i,val1 in enumerate(nums1):
            for j,val2 in enumerate(nums2):
                if val1%(val2*k)==0:
                    count+=1
        return count
        
```
['Python3']