#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#define int long long
//#define endl '\n'
using namespace std;
typedef pair<int,int> PII;
const int N=200200;
int n,k;
int l[N],r[N];
void solve(){
	cin>>n>>k;
	if(k==0||k>n){
		cout<<-1<<endl;
		return;
	}
	if(k%2==0){
		for(int i=1;i<=n;i++){
			if(k>0){
			    if(i%2==1){
				    cout<<i+1;
			    }
			    else cout<<i-1;
			    k--;
			}
			else cout<<i;
			if(i!=n) cout<<" ";
		}
		cout<<endl;
	}
	else{
		cout<<1;
		k--;
		for(int i=2;i<=n;i++){
			if(k>0){
			    if(i%2==1){
				    cout<<" "<<i-1;
			    }
			    else cout<<" "<<i+1;
			    k--;
			}
			else cout<<" "<<i;
		}
		cout<<endl;
	}
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
	return 0;
}