Leetcode 2644. Find the Maximum Divisibility Score

Given arrays nums and divisors, compute for each divisor how many nums are divisible by it and return the divisor with the highest count (breaking ties by the smallest divisor). With lengths up to 1000, a straightforward O(n*m) scan counting divisibility for each divisor is sufficient.