Python3 Straightforward Solution
# Code\n```python3 []\nclass Solution:\n  def maxDivScore(self, nums: List[int], divisors: List[int]) -> int:\n    scores = []\n    for i in range(len(divisors)):\n      cur_divisibility_score = 0\n      for j in range(len(nums)):\n        if nums[j] % divisors[i] == 0:\n          cur_divisibility_score += 1\n      scores.append(cur_divisibility_score)\n    \n    max_divisibility = float(\'-inf\')\n    for i in range(len(scores)):\n      max_divisibility = max(max_divisibility, scores[i])\n\n    min_divisor = float(\'inf\')\n    for i in range(len(scores)):\n      if scores[i] == max_divisibility:\n        min_divisor = min(min_divisor, divisors[i])\n    \n    for i in range(len(scores)):\n      if scores[i] == max_divisibility:\n        if divisors[i] == min_divisor:\n          return divisors[i]\n    \n    return -1\n```
['Python3']