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.

Examples

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.
import java.util.Scanner;

public class Check {

	public static void main(String[] args) {
		int[] result = new int[1000000];
		// TODO Auto-generated method stub
		try(Scanner scanner = new Scanner(System.in)){
			int n, k;
			n = scanner.nextInt();
			k = scanner.nextInt();
			if(k>=n){
				System.out.println(-1);
				return;
			} else {
				for(int i=1;i<=k;i++){
					result[i] = i+1;
				}
				if(k<n-2){
					for(int i=k+1;i<=n-2;i++){
						result[i] = i+2;
					}
				}
				if(k<n-1){
					result[n-1] = 1;
					result[0] = k+2;
				} else {
					result[0] = 1;
				}				
			}
			for(int i=0;i<n-1;i++){
				System.out.print(result[i]);
				System.out.print(' ');
			}
			System.out.print(result[n-1]);
		}
	}
	
	public static void print(int floor, int nonFloor, int num, int pos){
		for(int i=0;i<num;i++){
			if(i==pos){
				System.out.print(nonFloor);
			} else {
				System.out.print(floor);
			}
			if(i==num-1){
				System.out.print("\n");				
			} else {
				System.out.print(" ");
			}
		}
	}

}