1ms 100% beat in java very easiest code 😊.
Code
![94da60ee-7268-414c-b977-2403d3530840_1725903127.9303432.png](https://assets.leetcode.com/users/images/074cbc2e-f76b-403f-acb9-d727bcb1b16f_1736414507.1470435.png)


# Code
```java []
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;
    }
}
```
['Java']