def climbingLeaderboard(scores, alice):
    rank = []
    rescores = sorted(set(scores), reverse=True)
    l = len(rescores)
    t = 0
    for i in alice:
        if i < rescores[-1] :
            rank.append(l+1)
        elif rescores[0] <= i:
            rank.append(1)
        else:
            for j in range(t, l - 1):
                if rescores[l - 1 - j] <= i < rescores[l - 1 -j - 1]:
                    rank.append(l - j )
                    t = j
                    break
    return rank