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.
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.*;
import java.util.*;

/**
 * @author Assassin
 */
public class B {

    private BufferedReader reader;
    private PrintWriter out;
    private StringTokenizer tokenizer;
    //private final String filename = "filename";

    private void init(InputStream input, OutputStream output) throws IOException {
        reader = new BufferedReader(new InputStreamReader(input));
        out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(output)));
        //reader = new BufferedReader(new FileReader(filename + ".in"));
        //out = new PrintWriter(new FileWriter(filename + ".out"));
        tokenizer = new StringTokenizer("");
    }

    private String nextLine() throws IOException {
        return reader.readLine();
    }

    private String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(nextLine());
        }
        return tokenizer.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    private long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    private double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    private void run() throws IOException {
        init(System.in, System.out);
        //long startTime = System.currentTimeMillis();
        int n = nextInt();
        int k = nextInt();
        if (n == k) {
            out.println("-1");
        } else {
            int x = n - k;
            for (int i = 0; i < x - 1; i++) {
                out.print((i + 2) + " ");
            }
            out.print(1 + " ");
            for (int i = x; i < n; i++) {
                out.print((i + 1) + " ");
            }
            out.println();
        }
        //long runTime = System.currentTimeMillis() - startTime;
        //out.println(runTime);
        out.close();
        System.exit(0);
    }

    public static void main(String[] args) throws IOException {
        new B().run();
    }
}