from collections import deque
def solution(priorities, location):
order_list = deque(priorities)
cur = location
print_cnt = 0
while cur >= 0:
if order_list[0] >= max(order_list):
order_list.popleft()
cur -= 1
print_cnt += 1
else:
order_list.rotate(-1)
if cur == 0:
cur = len(order_list) - 1
else:
cur -= 1
return print_cnt
a = deque([1,2,3,4])
a.rotate(1) # [4,1,2,3]
a.rotate(-1) # [2,3,4,1]