99.94% beats solution in java
\n\n# Code\n\nclass Solution {\n    public int numberOfPairs(int[] nums1, int[] nums2, int k) {\n        \n        int no_of_good_pair=0;\n        for( int i=0;
\n\n# Code\n```\nclass Solution {\n    public int numberOfPairs(int[] nums1, int[] nums2, int k) {\n        \n        int no_of_good_pair=0;\n        for( int i=0; i<nums1.length; i++)\n        {\n            for( int j=0; j<nums2.length; j++)\n            {\n                if(nums1[i]%(nums2[j]*k)==0){\n                    no_of_good_pair++;\n                }\n            }\n        }\n        return no_of_good_pair;\n    }\n}\n```
['Java']