Neat and Clean Solution in Java 🪄🪄
\uD83D\uDCBB Code\njava []\nclass Solution {\n    public int numberOfPairs(int[] nums1, int[] nums2, int k) {\n        int n = nums1.length, m = nums2.length;\n
# \uD83D\uDCBB Code\n```java []\nclass Solution {\n    public int numberOfPairs(int[] nums1, int[] nums2, int k) {\n        int n = nums1.length, m = nums2.length;\n        int cnt = 0;\n\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < m; j++) {\n                if (nums1[i] % (nums2[j] * k) == 0) {\n                    cnt++;\n                }\n            }\n        }\n\n        return cnt;\n    }\n}\n```
['Array', 'Java']