def absolutePermutation(n, k):
    if k == 0:
        return [i+1 for i in range(n)]
        
    lexMap = {}
    for i in range(n):
        lexMap[i+1] = True
    
    res = []
    for i in range(1, n+1):
        if i-k in lexMap:
            res.append(i-k)
            del lexMap[i-k]
        elif i+k in lexMap:
            res.append(i+k)
            del lexMap[i+k]
    
    return res if len(lexMap) == 0 else [-1]