时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
题目描述
Kotori is very good at math (really?) and she loves playing with permutations and primes.
One day, she thinks of a special kind of permutation named
co-prime permutation. A permutation 
of 
is called a co-prime permutation of if there exists exactly integers 
such that 
and 
, where 
indicates the greatest common divisor of 
and 
.
Given and , please help Kotori construct a co-prime permutation of or just report that there is no such permutation.
Recall that a permutation of is a sequence of length containing all integers from 
to .
One day, she thinks of a special kind of permutation named
Given
Recall that a permutation of
输入描述:
There is only one test case in each test file.
The first and only line contains two integers,
).
输出描述:
Output one line containingseparated by one space, indicating the permutation satisfying the given constraints. If no such permutation exists output "-1" (without quotes) instead. If there are multiple valid answers you can print any of them.
Please, DO NOT output extra spaces at the end of each line, otherwise your answer may be considered incorrect!