Problem: 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.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

import java.math.*;

public class P1 {

	public static void main(String[] args) {
		InputReader in = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int k = in.nextInt();
		int a[] = new int[n + 1];
		int j = n;

		for (int i = 0; i < k; i++) {
			a[j] = j;
			j--;
		}
		int flag = 0;
		j = 1;
		for (int i = 1; i < n - k; i++) {
			if (a[j] != 0) {
				flag = -1;
			}
			a[j] = j + 1;
			j++;
		}
		if (a[j] == 0) {
			a[j] = 1;
		} else {
			flag = -1;
		}

		if (flag == -1) {
			out.println("-1");
			out.close();
			return;
		}
		for (int i = 1; i <= n; i++) {
			out.print(a[i] + " ");
		}
		out.close();

	}

	static int a[][];
	static long fac[], ifac[], DR[] = new long[101];
	static int MOD = (int) (1e9 + 7);
	static boolean[] isPrime;
	static int minPrime[];
	static long dp[][];
	static int n;
	static int d, x, y;

	static int gcd(int a, int b) {
		if (b == 0)
			return a;
		return gcd(b, a % b);
	}

	static long mp(long a, long b) {
		long ans = 1;

		while (b != 0) {
			if (b % 2 == 1)
				ans = (ans * a) % MOD;

			a = (a * a) % MOD;
			b /= 2;

		}
		return ans % MOD;
	}

	static void precompute() {
		int i;
		int N = 1000005;
		fac = new long[N];
		ifac = new long[N];
		fac[0] = 1;
		for (i = 1; i < N; i++) {
			fac[i] = (i * fac[i - 1]) % MOD;
		}
		ifac[N - 1] = mp(fac[N - 1], MOD - 2);
		for (i = N - 2; i >= 0; i--) {
			ifac[i] = ((i + 1) * ifac[i + 1]) % MOD;

		}
	}

	public static long combine(int n, int k) {
		if (k > n - k) {
			k = n - k;
		}
		long result = 1;
		for (int i = 0; i < k; i++) {
			result *= (n - i);
			result /= (i + 1);
		}
		return result;
	}

	static long mInv(long A) {

		return mp(A, MOD - 2);

	}

	static long mC(int n, int k) {
		// calculates C(n,k) mod p (assuming p is prime).
		// if(k>n-k)k=n-k;
		long an; // n * (n-1) * ... * (n-k+1)
		if (k <= 0)
			return 1;
		if (n < k)
			return 0;

		an = fac[n] % MOD;
		an *= ifac[n - k];
		an %= MOD;
		an *= ifac[k];
		an %= MOD;

		// numerator / denominator mod p.
		return an;
	}

	static long div(long num) {
		long c = 0;
		for (long i = 1; i <= num; ++i)
			if (num % i == 0)
				c++;
		return c;
	}

	static int[][] segtree;

	static class InputReader {

		private InputStream stream;
		private byte[] buf = new byte[8192];
		private int curChar, snumChars;
		private SpaceCharFilter filter;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public int nextInt() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public int[] nextIntArray(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public String readString() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
}