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.io.*;
import java.util.*;
import java.math.*;

@SuppressWarnings("unused")
public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		InputStream inputStream = System.in;
		// InputStream inputStream = new FileInputStream(new File(
		// "C:\\Users\\Administrator\\Codeblocks\\First\\1.in"));
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(1, in, out);
		out.close();
	}
}

// 使用对象时,首先考虑是否要采用深复制

class TaskA {
	static final int mod = (int) 1e9 + 7;
	static final int INF = 0x7fffffff;
	static final double eps = 1e-15;
	static final int maxn = (int) 1e6;

	// 声明全局变量
	public void solve(int testNumber, InputReader in, PrintWriter out) {// START
		int N = in.nextInt();
		int K = in.nextInt();
		if (N == K)
			out.println("-1");
		else {
			for (int i = 1; i <= N; i++) {
				if (i == N - K)
					out.print(1);
				else if (i < N - K)
					out.print(i + 1);
				else out.print(i);
				if(i<N) out.print(" ");
				else out.print("\n");
			}
		}
	}// END
}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = null;
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

}

		     		   			   	 	  						 	