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.
/*
    This code is written by KESHAV DAGA
    @keshavkeshu
*/


import java.util.*;
import java.io.*;
public class Main  
{
    static FastReader in=new FastReader();
    static final Random random=new Random();
    static int mod=1000000007;
    static int inf=Integer.MAX_VALUE;
    static int ninf=Integer.MIN_VALUE;
    static HashMap<String,Integer>map=new HashMap<>();
    static String yes="YES",no="NO";

    public static void main(String args[]) throws IOException {
        /*
            This is main section or the coding part
            @keshavkeshu
        */
        int t=1;//in.nextInt();
        StringBuilder res=new StringBuilder();
        while(t-->0)
        {
            // logic
            int n=in.nextInt();
            int k=in.nextInt();
            if(n==k)
            {
                print(-1);
            }
            else{
                res.append((n-k)+" ");
                for(int i=1;i<n-k;i++)
                {
                    res.append(i+" ");
                }
                for(int i=n-k+1;i<=n;i++)
                {
                    res.append(i+" ");
                }
            }
            //res.append("\n");
            
        }
        
        print(res);
    }
    
   
    
   
   
    
    static int max(int a, int b)
    {
        if(a<b)
        	return b;
        return a;
    }
    
    static int min(int a, int b)
    {
        if(a>b)
        	return b;
        return a;
    }
    
    static long max(long a, long b)
    {
        if(a<b)
        	return b;
        return a;
    }
    
    static long min(long a, long b)
    {
        if(a>b)
        	return b;
        return a;
    }
    static int max(int a, int b, int c)
    {
        if(a>b && a>c)
        	return a;
        else if(b>a && b>c)
            return b;
        else
            return c;
    }
    
    static int min(int a, int b, int c)
    {
        if(a<b && a<c)
        	return a;
        else if(b<a && b<c)
            return b;
        else
            return c;
    }
    
     
    static void ruffleSort(int[] a) {
        int n=a.length;
        for (int i=0; i<n; i++) {
            int oi=random.nextInt(n), temp=a[oi];
            a[oi]=a[i]; a[i]=temp;
        }
        Arrays.sort(a);
    }

    static < E > void print(E res)
    {
        System.out.println(res);
    }
    
    static < E > void printd(E res)
    {
        System.out.println(res);
    }


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

    
    static int abs(int a)
    {
        if(a<0)
            return -1*a;
        return a;
    }

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

        int [] ria(int n) {
            int res [] = new int [n];
            for(int i = 0; i<n; i++)res[i] = nextInt();
            return res;
        }
        long [] rla(int n) {
            long res [] = new long [n];
            for(int i = 0; i<n; i++)res[i] = nextLong();
            return res;
        }
    }

}
