simple python solution ..with simple logic...
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def maxDivScore(self, nums: List[int], divisors: List[int]) -> int:\n        m=0\n        k=0\n        divisors.sort()\n        for i in divisors:\n            l=0\n            for j in nums:\n                if j%i==0:\n                    l+=1\n            if l>m:\n                m=l\n                k=i\n        if m==0:\n            return divisors[0]\n        return k\n        \n```
['Python3']