Easy Construction

题号：NC209730
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Roundgod is given $n_{}, k_{}$ , construct a permutation $P$ of $1\sim n$ satisfying that for all integers $i_{}$ in $[1, n]_{}$ , there exists a contiguous subarray in $P$ of length $i_{}$ whose sum is $k$ modulo $n$ . If there are multiple solutions, print any of them. If there is no solution, print "-1" in one line.

输入描述:

The first line contains two integers .

输出描述:

Print  integers, the answer permutation in one line if such permutation exists, or print "-1" in one line if no solution exists.

示例1

输入

复制

2 1

输出

复制

1 2

说明

The sum of subintervals  both satisfy , and their lengths are  respectively.

示例2

输入

复制

3 1

输出

复制

-1