def climbingLeaderboard(ranked, player):
    ranked = sorted(set(ranked), reverse=True)
    a,n,l = [],0,len(ranked)
    
    for i in player[::-1]:
        for j in range(n, l):
            if i >= ranked[n]:
                break
            n += 1
        a.append(n+1)

    return a[::-1]