# Google Code Jam 2023 Farewell Round B - Spacious Sets
from collections import deque

t = int(input())
for case in range(1, t + 1):
    n, k = map(int, input().split())
    a = list(map(int, input().split()))
    aa = [[a[i], i, 1] for i in range(n)]
    aa.sort()

    count = 0
    index = 0
    for i in range(1, n):
        if aa[index][0] + k <= aa[i][0]:
            count += 1
            index = i
        aa[i][2] += count
    count = 0
    index = n-1
    for i in range(n-1, -1, -1):
        if aa[i][0] + k <= aa[index][0]:
            count += 1
            index = i
        aa[i][2] += count
    aa.sort(key=lambda x: x[1])
    print("Case #{}: {}".format(case, " ".join([str(aa[i][2]) for i in range(n)])))