def solution(heights):
    tmp = []
    answer = []
    while(heights) :
        flag = 0
        right = heights.pop()
        for i in range(len(heights)-1, -1, -1) :
            if heights[i] > right :
                tmp.append(i+1)
                flag = 1
                break
        if flag == 0:
            tmp.append(0)
    answer = tmp[::-1]
    
    return answer