"""
출처:프로그래머스,
https://school.programmers.co.kr/learn/courses/30/lessons/154539
"""
# 풀이 과정
def solution(numbers):
    stack = []
    answer = [-1] * len(numbers)

    for i in range(len(numbers)):
        while stack and numbers[stack[-1]] < numbers[i]:
            answer[stack.pop()] = numbers[i]
        stack.append(i)

    return answer