题解 | #又放学辣（简单）#

N,M,K=map(int,input().split())
t=map(int,input().split())
b = Counter(t)

for i in range(1, M+1):
    t = [b[j] for j in range(1, M+1)]
    t.pop(i-1)
    if sum(t)<K:
        print(-1,end=" ")
    else:
        for times in range(K):
            t[t.index(max(t))]-=1
        print(max(t),end=" ")