Java&JS&TS Solution (JW)
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
```java []
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;
}
```
```javascript []
var numberOfPairs = function(nums1, nums2, k) {
    let count = 0;

    for (let i = 0; i < nums1.length; i++) {
        for (let j = 0; j < nums2.length; j++) {
            if (nums1[i] % (nums2[j] * k) === 0) {
                count++;
            }
        }
    }

    return count;
};
```
```typescript []
function numberOfPairs(nums1: number[], nums2: number[], k: number): number {
    let count = 0;

    for (let i = 0; i < nums1.length; i++) {
        for (let j = 0; j < nums2.length; j++) {
            if (nums1[i] % (nums2[j] * k) === 0) {
                count++;
            }
        }
    }

    return count;
};
```
['Array', 'Hash Table', 'Java', 'TypeScript', 'JavaScript']