Python super simple solution
```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        arr = sorted([a,b,c])\n        l = r  = 0\n        if arr[0] !
```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        arr = sorted([a,b,c])\n        l = r  = 0\n        if arr[0] != arr[1] - 1:\n            l += 1\n            r += arr[1] - 1 - arr[0]\n        if arr[1] != arr[-1] - 1:\n            r += arr[-1] - 1 - arr[1]\n            l += 1\n        if arr[0] == arr[1] - 2 or arr[1] == arr[-1] -2 :\n            l = 1\n        return [l,r]
[]