Simple solution using while loop
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: o(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: o(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        rec, i, t = [], 0, 1\n        while True:\n            if i in rec: break\n            rec.append(i)\n            i = (i + (k * t)) % (n)\n            t += 1\n        \n        op = []\n        for i in range(n):\n            if i not in rec:\n                op.append(i + 1)\n        return op\n        \n```
['Python3']