Simulation Easy Python solution.
\n# Code\n\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        start = 0\n        sset = set()\n        p = 1\n        whi
\n# Code\n```\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        start = 0\n        sset = set()\n        p = 1\n        while start not in sset:\n            sset.add(start)\n            start += p*k\n            start = start%n\n            p += 1\n        ans = []\n        for i in range(n):\n            if i not in sset:\n                ans.append(i+1)\n        return ans\n            \n        \n```
['Python3']