Python3 Imperative Approach
Code\npython3 []\nclass Solution:\n  def circularGameLosers(self, n: int, k: int) -> List[int]:\n    visited = [False for _ in range(n)]\n    position, turn = 0
# Code\n```python3 []\nclass Solution:\n  def circularGameLosers(self, n: int, k: int) -> List[int]:\n    visited = [False for _ in range(n)]\n    position, turn = 0, 1\n    while True:\n      if not visited[position]:\n        visited[position] = True\n        position = (position + turn * k) % n\n        turn += 1\n      else:\n        break\n    return [i + 1 for i in range(n) if not visited[i]]\n```
['Python3']