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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.BitSet;
public class A { 
		    public static void main(String[] args) {
		    	 FastReader sc=new FastReader();
		    	 	int n=sc.nextInt();
		    	 	int k=sc.nextInt();
		    	 	
		    	 	int c=0;
		    	 	if(k>=n) { System.out.println(-1); return; }
		    	 	for(int i=1;i<n+1;i++){
		    	 		if(i<=k+1) {
		    	 			if(i==1 && (n-k-1)%2==0) System.out.print(i+" ");
		    	 			else if(i==1) System.out.print(n+" ");
		    	 			else System.out.print(i+" ");
		    	 		} 
		    	 		else {
		    	 			c++;
		    	 			if(c==2) {
		    	 		        System.out.print(i+" "+(i-1)+" ");
		    	 				c=0;
		    	 			}
		    	 		}
		    	 		if(c==1 && i==n){
		    	 			if((n-k-1)%2==0) System.out.print(n+" ");
		    	 			else System.out.println(1+" ");
		    	 		}
		    	 	}
		    	
        }
		    	
       static class FastReader
		    {
		        BufferedReader br;
		        StringTokenizer st;
		 
		        public FastReader(){
		        		br = new BufferedReader(new InputStreamReader(System.in));
		        }
		 
		        String next()
		        {
		            while (st == null || !st.hasMoreElements())
		            {
		                try
		                {
		                    st = new StringTokenizer(br.readLine());
		                }
		                catch (IOException  e)
		                {
		                    e.printStackTrace();
		                }
		            }
		            return st.nextToken();
		        }
		 
		        int nextInt()
		        {
		            return Integer.parseInt(next());
		        }
		 
		        long nextLong()
		        {
		            return Long.parseLong(next());
		        }
		 
		        double nextDouble()
		        {
		            return Double.parseDouble(next());
		        }
		 
		        String nextLine()
		        {
		            String str = "";
		            try
		            {
		                str = br.readLine();
		            }
		            catch (IOException e)
		            {
		                e.printStackTrace();
		            }
		            return str;
		        }
		    }
}



