#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
int main()

{
    int n, k;
    cin >> n >> k;
    int l = n - k - 2;
    int cnt = 0;
    int sum = 0;
    string s = "";
    if (l > 2) {
        l -= 2;
        s += "0 2 1 3 ";
        cnt += 4;
        while (l - 4 >= 0) {
            s += "0 2 1 3 ";
            l -= 4;
            cnt += 4;
        }
    }
    if (l == 1) {
        s += "0 ";
        cnt += 1;
    }
    if (l == 2) {
        s += "0 2 ";
        cnt += 2;
    }
    if (l == 2) {
        s += "0 2 1 ";
        cnt += 3;
    }
    if (cnt > n) {
        cout << -1 << endl;
        return 0;
    }
    string g = "";
    rep(i, n - cnt)
    {
        g += "0 ";
    }

    cout << g + s << endl;
}