class Solution {
    public int findTheWinner(int n, int k) {
        int cycle=n-1, curr=0, temp;
        int[] arr = new int[n];
        while(cycle-- >0){
            temp=0;
            while(temp<k){
                if(arr[curr%n]==0) temp++;
                if(temp<k) curr++;
            }
            arr[curr%n]++;
            curr++;
        }
        
        for(int i=0; i<arr.length; i++){
            if(arr[i]==0) return i+1;
        }
        return -1;
    }
}