import java.util.ArrayList; import java.util.List;

public class Solution { public int LastRemaining_Solution(int n, int m) { List list = new ArrayList<>(); for(int i = 0;i < n;i++) list.add(i); int num = 0; int index = 0; while(list.size() != 1) { if(num == m-1) { list.remove(index); num = 0; if(index > list.size()-1) index = 0; }else { if(index >= list.size()-1) index = 0; else index++;

    		num++;
    	}
    }
	
	return list.get(0);
}

}