Fast clear code
Code\npython3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        a, b, c = sorted([a, b, c], reverse=True)\n      
# Code\n```python3 []\nclass Solution:\n    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:\n        a, b, c = sorted([a, b, c], reverse=True)\n        return [0 if a==b+1==c+2 else 1 if a==b+1 or b==c+1 or a==b+2 or b==c+2 else 2, a-c-2]\n        #         already consecutive   two consecutive         fill gap      move two  most possible moves\n```
['Python3']