In universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n empty baskets, the ith basket is at position[i], Morty has m balls and needs to distribute the balls into the baskets such that the minimum magnetic force between any two balls is maximum.
Rick stated that magnetic force between two different balls at positions x and y is |x - y|.
Given the integer array position and the integer m. Return the required force.
 
Example 1:

Input: position = [1,2,3,4,7], m = 3
Output: 3
Explanation: Distributing the 3 balls into baskets 1, 4 and 7 will make the magnetic force between ball pairs [3, 3, 6]. The minimum magnetic force is 3. We cannot achieve a larger minimum magnetic force than 3.

Example 2:
Input: position = [5,4,3,2,1,1000000000], m = 2
Output: 999999999
Explanation: We can use baskets 1 and 1000000000.

 
Constraints:

n == position.length
2 <= n <= 10^5
1 <= position[i] <= 10^9
All integers in position are distinct.
2 <= m <= position.length

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# class Solution:\n#     def maxDistance(self, position: List[int], m: int) -> int:\n#         #首先排序\n#         position.sort()\n#         print(position)\n        \n#         left = 1000000000\n#         right = position[-1] - position[0]\n#         for i in range(len(position)-1):\n#             diff = abs(position[i] - position[i+1])\n#             left = min(left, diff)\n            \n            \n#         def check(diff, p, m):\n#             m -= 1\n#             last = p[0]\n#             for i in range(1, len(p)):\n#                 if abs(p[i] - last) >= diff:\n#                     m -= 1\n#                     last = p[i]\n#                     if m <= 0:\n#                         print(diff, \\"True\\")\n#                         return True\n#                 else:\n#                     pass\n#             print(diff, \\"False\\")\n#             return False\n            \n#         print(\\"left\\", left, \\"right\\", right)\n#         while left < right:\n#             mid = (left + right) // 2\n#             if check(mid, position, m) == True:\n#                 left = mid\n#                 if left == right:\n#                     print(\\"find 1\\", left)\n#                     break\n#                 if left + 1 == right:\n#                     if check(right, position, m):\n#                         left = right\n#                         print(\\"find 2\\", left)\n#                     break\n#             else:\n#                 right = mid - 1\n        \n                \n#         print(\\"find 3\\", left)\n#         return left\n\n# class Solution:\n#     def maxDistance(self, position: List[int], m: int) -> int:\n#         #首先排序\n#         position.sort()\n#         # print(position)\n        \n#         distance = [0 for _ in range(len(position)-1)]\n#         for i in range(len(position)-1):\n#             diff = position[i+1] - position[i]\n#             distance[i] = diff\n#         left = min(distance)\n#         right = ceil((position[-1] - position[0]) / (m-1))\n            \n#         def check(diff, m):\n#             m -= 1\n#             pre_dis = 0\n#             for i in range(0, len(distance)):\n#                 if distance[i]+pre_dis >= diff:\n#                     m -= 1\n#                     if m <= 0:\n#                         # print(diff, \\"True\\")\n#                         return True\n#                     pre_dis = 0\n#                 else:\n#                     pre_dis += distance[i]\n#             # print(diff, \\"False\\")\n#             return False\n            \n#         # print(\\"left\\", left, \\"right\\", right)\n#         while left < right:\n#             mid = (left + right+1) // 2\n#             if check(mid, m) == True:\n#                 left = mid\n#                 # if left == right:\n#                 #     print(\\"find 1\\", left)\n#                 #     break\n#                 # if left + 1 == right:\n#                 #     if check(right, position, m):\n#                 #         left = right\n#                 #         print(\\"find 2\\", left)\n#                 #     break\n#             else:\n#                 right = mid - 1\n        \n                \n#         # print(\\"find 3\\", left)\n#         return left\n        \nclass Solution:\n    def maxDistance(self, position: List[int], m: int) -> int:\n        position.sort()\n\n        result = 0\n\n        # can we place m balls each separated by x distance?\n        def check(x) -> bool:\n            nonlocal position, m\n\n            last = position[0]\n            placed = 1\n            for pos in position:\n                if pos - last >= x:\n                    placed += 1\n                    if placed >= m:\n                        return True\n                    last = pos\n\n            return False\n\n\n\n        first = 0\n        last = int(ceil((position[-1] - position[0])/(m-1)))\n        while first < last:\n\n            mid = (first + last + 1)//2\n\n            if check(mid):\n                result = mid\n                first = mid\n            else:\n                last = mid - 1\n\n        return first'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxDistance'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5756