def absolutePermutation(n, k):
    # Write your code here    
    if k == 0:
        return [i for i in range(1,n+1,1)]
    elif n % (2*k) != 0:
        return [-1]
    else:
        if k == 1:
            return [i+1 if i%2 != 0 else i-1 for i in range(1,n+1,1)]
        elif k <= n/2 and n % k == 0:
            a = 1
            flag = True
            ans = []
            while a <= n:
                if flag:
                    ans.append(a+k)
                else:
                    ans.append(a-k)
                a += 1
                if a % k == 1:
                    flag = not flag
            return ans
        else:
            return [-1]