def merge_intvls(intvls):
    intvls.sort(key=lambda x: x[0])
    merged = []
    
    for curr in intvls:
        if not merged or merged[-1][1] < curr[0]:
            merged.append(list(curr))
        else:
            merged[-1][1] = max(merged[-1][1], curr[1])
    
    return merged

def count_msgs(n, k, links):
    res = []
    
    for i in range(n):
        intvls = []
        left = max(0, i - k)
        right = min(n - 1, i + k)
        intvls.append((left, right))
        
        curr = i
        while links[curr] > 0:
            curr = links[curr] - 1
            left = max(0, curr - k)
            right = min(n - 1, curr + k)
            intvls.append((left, right))
        
        merged_intvls = merge_intvls(intvls)
        distinct_count = sum(end - start + 1 for start, end in merged_intvls)
        
        res.append(distinct_count)
    
    return res

n, k = map(int, input().split())
links = list(map(int, input().split()))

result = count_msgs(n, k, links)
print(" ".join(map(str, result)))