class Solution:
def LastRemaining_Solution(self, n, m):
if n == 1 or m == 0:
return -1
arr = []
for i in range(n):
arr.append(i)
index = 0
while len(arr) > 1:
index += m - 1
if index > len(arr):
index = index % len(arr)
elif index == len(arr):
index = 0
del arr[index]
return arr[0]