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:
//    A Computer is Like a mischievous genie.
//    It will give you exactly what you ask for,
//    but not always what you want
//    A code by Rahul Verma




import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.SortedSet;

import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;



public class Main {



  public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

  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[] nextSArray() {
      String sr[] = null;
      try {
        sr = br.readLine().trim().split(" ");
      } catch (IOException e) {
        e.printStackTrace();
      }
      return sr;
    }

    String nextLine() {
      String str = null;
      try {
        str = br.readLine();
      } catch (IOException e) {
        e.printStackTrace();
      }

      return str;
    }
  }


//  static long powmodulo(long a, long p) {
//    if (p == 0)
//      return 1 % mod;
//    if (p == 1)
//      return a % mod;
//    long ans = 1;
//    while (p > 0) {
//      if ((p & 1) > 0) {
//        ans = (ans * a) % mod;
//      }
//      a = (a * a) % mod;
//      p = p >> 1;
//    }
//    return ans % mod;
//  }



//
//  static long mod = 1000000007;
//
//  static long gcd(long a,long b)
//  {
//    if(a==0)
//      return b;
//    return  gcd(b%a,a);
//  }
//
//  static long fast_powerNumbers(long a,long n)
//  {
//    if(n==1)
//      return a;
//    long ans=fast_powerNumbers(a,n/2);
//    if(n%2==0)
//      return (ans*ans);
//    else
//      return ((ans*ans)*(a));
//  }


//
//  static void dfs_helper(int [][] arr,int i,int j,int team,int n,int m)
//  {
//    arr[i][j]=team;
//    if(i-1>=0 && arr[i-1][j]==1)
//      dfs(arr,i-1,j,team,n,m);
//    if(j-1>=0 && arr[i][j-1]==1)
//      dfs(arr,i,j-1,team,n,m);
//    if(i+1< n && arr[i+1][j]==1)
//      dfs(arr,i+1,j,team,n,m);
//    if(j+1<m && arr[i][j+1]==1)
//      dfs(arr,i,j+1,team,n,m);
//
//  }
//
//
//  static int visited[];
//  static HashMap<Integer,ArrayList<Integer>>hm;
//
//
//  static void dfs(int [][] arr,int i,int j,int team,int n,int m)
//  {
//    dfs_helper(arr,i,j,team,n,m);
//
//  }




  
  public static void main(String[] args) throws Exception {
    FastReader sc = new FastReader();

//    int t1 = sc.nextInt();
//
//    for (int t = 0; t < t1 ; t++) {
//
//    }

    //out.close();

   int n=sc.nextInt();
   int k=sc.nextInt();
   k=n-k;

   if(k==0)
   {
     System.out.println(-1);
     return;
   }
   int arr[]=new int[n];
   


    for (int i = 0; i <k ; i++) {
      arr[i] = i+2;
    }
    arr[k-1]=1;
    for (int i = k; i < n; i++) {
      arr[i]=i+1;
    }

    System.out.println(Arrays.toString(arr).replaceAll("[\\[|\\]|,]",""));
  }

}

class Pair
{
  int a; int b;
  Pair(int a,int b)
  {
    this.a=a;
    this.b=b;
  }
}


class Graph
{
  HashMap<Integer,ArrayList<Integer>>hm;
  Graph()
  {
    hm=new HashMap<>();
  }
  Graph(int n){

    hm=new HashMap<>();
    for (int i = 1; i <=n ; i++) {
      hm.put(i,new ArrayList<Integer>());
    }
  }
  // function for adding an edge.................................................
  public void addEdge(int a,int b,boolean isDir)
  {
    if(isDir)
    {
      if(hm.containsKey(a))
      {
        hm.get(a).add(b);
      }
      else
      {
        hm.put(a,new ArrayList<>(Arrays.asList(b)));
      }
    }
    else
    {
      if(hm.containsKey(a))
      {
        hm.get(a).add(b);
      }
      else if(!hm.containsKey(a))
      {
        hm.put(a,new ArrayList<>(Arrays.asList(b)));
      }

      if(hm.containsKey(b))
      {
        hm.get(b).add(a);
      }
      else if(!hm.containsKey(b))
      {
        hm.put(b,new ArrayList<>(Arrays.asList(a)));
      }
    }
  }

  public void addWeightededge(){

  }



}

// out.println(al.toString().replaceAll("[\\[|\\]|,]",""));