Brute Force
IntuitionApproachComplexity
Time complexity: O(n^2)

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^2)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

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

# Code
```csharp []
public class Solution {
    public int NumberOfPairs(int[] nums1, int[] nums2, int k) {
        int ans = 0;
        for(int i = 0; i < nums1.Length; i++)
            for(int j = 0; j < nums2.Length; j++)
                if(nums1[i] % (nums2[j]*k) == 0)
                    ans++;
        return ans;
    }
}
```
['Array', 'C#']