this should be an easy.
\n# Code\n\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        stones = [a, b, c]\n        stones.sort()\n        minM
\n# Code\n```\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        stones = [a, b, c]\n        stones.sort()\n        minMoves = 0\n        maxMoves = 0\n        if(stones[1]-stones[0] == 1 and stones[2]-stones[1] == 1):\n            minMoves = 0\n            maxMoves = 0\n        elif stones[1]-stones[0] ==2 or stones[2]-stones[1] ==2:\n            minMoves = 1\n            maxMoves =  stones[2] - stones[0] - 2\n        elif(stones[1]-stones[0] == 1 or stones[2]-stones[1] == 1):\n            minMoves = 1\n            maxMoves = max(stones[1]-stones[0], stones[2]-stones[1])-1\n        else:\n            minMoves = 2\n            maxMoves =  stones[2] - stones[0] - 2\n        return [minMoves, maxMoves]\n        \n```
['Python3']