prices [1, 2, 3, 2, 3]
def solution(prices):
from collections import deque
queue = deque(prices)
answer = []
while queue:
cnt = 0
now = queue.popleft()
for q in queue:
cnt += 1
if now > q:
break
answer.append(cnt)
return answer