class Solution:
    def findTheWinner(self, n: int, k: int) -> int:
        #TC: amortized O(len(Friend))
        #SC: O(len(Friend))

        Friend = [i+1 for i in range(n)]
        start = 0

        while(len(Friend) > 1):
            next = (start + k - 1) % n 
            Friend.pop(next)
            start = next
            n -= 1

        return Friend[0]