Levko and Permutation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Levko loves permutations very much. A permutation of length n is a sequence of distinct positive integers, each is at most n.

Let’s assume that value gcd(a, b) shows the greatest common divisor of numbers a and b. Levko assumes that element pi of permutation p1, p2, ... , pn is good if gcd(i, pi) > 1. Levko considers a permutation beautiful, if it has exactly k good elements. Unfortunately, he doesn’t know any beautiful permutation. Your task is to help him to find at least one of them.

Input

The single line contains two integers n and k (1 ≤ n ≤ 105, 0 ≤ k ≤ n).

Output

In a single line print either any beautiful permutation or -1, if such permutation doesn’t exist.

If there are multiple suitable permutations, you are allowed to print any of them.

Sample test(s)

input

4 2

output

2 4 3 1

input

1 1

output

-1

Note

In the first sample elements 4 and 3 are good because gcd(2, 4) = 2 > 1 and gcd(3, 3) = 3 > 1. Elements 2 and 1 are not good because gcd(1, 2) = 1 and gcd(4, 1) = 1. As there are exactly 2 good elements, the permutation is beautiful.

The second sample has no beautiful permutations.

题意：有一个从1～n的数组（下标从1开始），现在要进行重新排序，排序后使得数组中的数与其下标的最大公约数大于1，最后符合这种条件的数必须有k个，输出任意一个满足的数组。

分析：任何数与1的最大公约数一定是1，相邻的两个正整数互素，所以让后k个数位置不变（下标与元素相同，最大个公约数是其本身），让第n-k个数到下标为1的位置，然后剩下的数顺势向后移动一位（即下标+1）。

#include<stdio.h>
int main()
{
    int n,k;
    int i;
    scanf("%d%d",&n,&k);
    if(k>=n)
    {
        printf("-1\n");
        return 0;
    }

    printf("%d ",n-k);

    for(i=1;i<n-k;i++)
        printf("%d ",i);

    for(i=n-k+1;i<n;i++)
        printf("%d ",i);

    if(n-k!=n)//k=0的时候直接让最后一个数到下标为1的地方即可。
        printf("%d\n",n);

    return 0;
}