#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;

int main(void){
	int n, k; cin >> n >> k;
	int cnt = n - k - 2;
	if(cnt < 0){printf("-1\n"); return 0;}
	vector<int> retu;
	if(cnt >= 1){
		retu.pb(0), retu.pb(2), retu.pb(1);
		bool f = true;
		int now = 1;
		cnt--;
		rep(i, cnt){
			if(f) now += 2, retu.pb(now), f = false;
			else now -= 1, retu.pb(now), f = true;
		}
	}else{
		retu.pb(0);
	}
	int d = n - retu.size();
	int t = retu[retu.size() - 1];
	rep(i, d) retu.pb(t);
	rep(i, n){
		if(i != n - 1) printf("%d ", retu[i]);
		else printf("%d\n", retu[i]);
	}
	return 0;
}