My solution
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution(object):\n    def circularGameLosers(self, n, k):\n        """\n        :type n: int\n        :type k: int\n        :rtype: List[int]\n        """\n        members = [i for i in range(n)]\n        held = []\n        holder = 0\n        i = 1\n\n        while True:\n            held.append(holder)\n            holder = (holder + (i * k)) % (n)\n            if holder in held:\n                break\n\n            i += 1\n        \n        return [j+1 for j in members if j not in held]\n\n```
['Python']