def solution(priorities, location):
answer = location
i = 0
while True:
flag = False
for j in range(i, len(priorities)):
if priorities[j]>priorities[i]:
temp = priorities[i]
priorities.remove(temp)
priorities.append(temp)
flag = True
if i == answer:
answer = len(priorities)-1
elif answer>i:
answer -= 1
break
if flag == False:
i+=1
print(priorities)
if(i >= len(priorities)):
break
return answer+1