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.*;

import java.io.*;

public class cp2 {
	static int distinct(ArrayList<String> arr, ArrayList<String> arr2){
		HashSet<String> hs = new HashSet<String>();
		for(int i = 0;i < arr.size();i++) {
			hs.add(arr.get(i));
		}
		for(int i = 0;i < arr2.size();i++) {
			hs.add(arr2.get(i));
		}
		
		return hs.size();
		
	}
	
	public int sumOfUnique(int[] nums) {
        int dp[] = new int[nums.length];
        int res = 0, max_sum = 0, min_sum = 0;
        
        for (int i : nums) {
            max_sum = Math.max(0, i + max_sum);
            min_sum = Math.min(0, i + min_sum);
            res = Math.max(res, Math.max(max_sum, -min_sum));
        }
        return res;
        
        
    }
	static boolean checkForPrime(int inputNumber){
		boolean isItPrime = true;
	 
		if(inputNumber <= 1) {
			isItPrime = false;
	 
			return isItPrime;
		}
		else{
			for (int i = 2; i<= inputNumber/2; i++) {
				if ((inputNumber % i) == 0){
					isItPrime = false;
	 
					break;
				}
			}
	 
			return isItPrime;
		}
	}
	static boolean isPrime(int n) 
    { 
       
        if (n <= 1) 
            return false; 
        if (n <= 3) 
            return true; 
  
        if (n % 2 == 0 || n % 3 == 0) 
            return false; 
  
        for (int i = 5; i * i <= n; i = i + 6) 
            if (n % i == 0 || n % (i + 2) == 0) 
                return false; 
  
        return true; 
    }
	static void alicenbob(boolean dp[][]) {
//		dp = new boolean[1001][1001];
		for(int i = 0;i<=1000;i++) {
			for(int j = 0;j<= 1000; j++) {
				if(i == 0 && j == 0) {
					dp[i][j] = false;
				}
				else if(i == 0 && j!=0) {
					dp[i][j] = true;
				}
				else if(j == 0 && i!=0) {
					dp[i][j] = true;
				}
				else {
					int min = Math.min(i, j);
					dp[i][j] = false;
					for(int k = 1; k<=min ;k++) {
						if(dp[i-k][j-k] == false) {
							dp[i][j] = true;
							break;
						}
					}
					for(int k = 1; k<=i ;k++) {
						if(dp[i-k][j] == false) {
							dp[i][j] = true;
							break;
						}
					}
					for(int k = 1; k<=j ;k++) {
						if(dp[i][j-k] == false) {
							dp[i][j] = true;;
							break;
						}
					}
					
					
				}
				
			}
		}
		
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		
		read in = new read();
		
		in.init(System.in);
		int n = in.nextInt();
		int k = in.nextInt();
		if(n == k) {
			System.out.println(-1);
		}
		else if((n-k)==1) {
			for(int j = 1;j<= n;j++) {
				System.out.print(j+" ");
			}
			System.out.println();
		}
		else {
			
			int arr[] = new int [n+1];
			if((n-k)%2 == 0) {
				arr[1] = n;
				arr[n] = 1;
				int f = 2;
				for(int j = 0;j<k;j++) {
					arr[f] = f;
					f++;
				}
				int f1 = 1+k+1;
				for(int j = f1;j<= n-1;j+=2) {
					arr[j] = j+1;
					arr[j+1] = j;
					
				}
				
			}
			else {
				arr[1] = 1;
				int f = 2;
				for(int j = 0;j<k;j++) {
					arr[f] = f;
					f++;
				}
				int f1 = 1+k+1;
				for(int j = f1;j<= n;j+=2) {
					arr[j] = j+1;
					arr[j+1] = j;
					
				}
			}
			for(int j = 1;j<=n;j++) {
				System.out.print(arr[j]+" ");
			}
			System.out.println();
			
		}
		
		
//		read.init(System.in);
//		int t = read.nextInt();
//		for(int i = 0;i<t;i++) {
//			int n = read.nextInt();
//			int m = read.nextInt();
//			int arr[] = new int[m];
//			for(int j = 0;j<n;j++) {
//				int x = read.nextInt();
//				arr[x%m]++; 
//			}
//			
//			int ans =0;
//			for(int j = 0;j<=m/2;j++) {
//				if(arr[j] == arr[(m-j)%m]&& arr[j]!=0) {
//					ans++;
//				}
//				else if(arr[j]> arr[(m-j)%m]) {
//					ans+= arr[j]- arr[(m-j)%m];
//					
//				}
//				else if(arr[j] < arr[(m-j)%m]) {
//					ans+=  arr[(m-j)%m] - arr[j];
//					
//				}
//			}
//			System.out.println(ans);
////				
//		}
       
		
//		read.init(System.in);
//		int t = read.nextInt();
//		for(int i = 0;i<t;i++) {
//			int a = read.nextInt();
//			int b = read.nextInt();
//			int n = read.nextInt();
//			int apow[] = new int[n];
//			int health[] = new int[n];
//			int sump= 0, sumh = 0;
//			for(int j = 0;j<n;j++) {
//				apow[j] = read.nextInt();	
//				sump = apow[j];
//			}
//			for(int j = 0;j<n;j++) {
//				health[j] = read.nextInt();
//				sumh = health[j];
//			}
//			int damage = 0;
//			for(int j = 0;j<n;j++) {
//				int x = 0;
//				if(health[j]%a == 0) {
//					 x = health[j]/a;
//					
//				}
//				else {
//					x = health[j]/a;
//					x++;
//				}
//				
//				damage += x * apow[j];
//				
//				
//			}
//			
//			Arrays.sort(apow);
//			int max = apow[n-1];
//			if(b> damage - max) {
//				System.out.println("YES");
//			}
//			else {
//				System.out.println("NO");
//			}
//			
//			
//			
//		}
//		
//		
//		
	
	}
}

class read {
    static BufferedReader reader;
    static StringTokenizer tokenizer;
 
   
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }
 
 
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
     
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }
 
    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
	
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
}
 
	


	


