def main():
    import sys
    N, K = map(int, sys.stdin.readline().split())
    S_min = N - 1
    S_max = (N * (N - 1)) // 2

    if K < S_min or K > S_max:
        print(-1)
        return

    if K == S_min:
        print(' '.join(map(str, range(1, N + 1))))
        return
    elif K == S_max:
        # Construct the maximal permutation
        result = []
        left = 1
        right = N
        while left <= right:
            if left == right:
                result.append(left)
                break
            result.append(left)
            result.append(right)
            left += 1
            right -= 1
        print(' '.join(map(str, result)))
        return
    else:
        # Construct a permutation starting with 2, 1, N, 3, 4, ..., N-1
        # Check if this permutation's sum is K
        if N == 2:
            print('2 1')
            return
        else:
            # Create the permutation
            permutation = [2, 1, N]
            current = 3
            while current < N:
                permutation.append(current)
                current += 1
            # Now check the sum
            total = 0
            for i in range(len(permutation)-1):
                total += abs(permutation[i] - permutation[i+1])
            if total == K:
                print(' '.join(map(str, permutation)))
                return
            else:
                print(-1)
                return

if __name__ == "__main__":
    main()