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.util.*;
 
import java.io.*;
 
public class cp2 {
	
	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();
			
		}
		

	
	}
}
 
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() );
    }
}