#include <bits/stdc++.h>
#define F(i,x,y) for(int i=(x);i<=(y);i++)
#define DF(i,x,y) for(int i=(x);i>=(y);i--)
#define ms(x,y) memset(x,y,sizeof(x))
#define SZ(x) (int)x.size()-1
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int,int> pii;
template<typename T> void chkmax(T &x,T y){ x=max(x,y);}
template<typename T> void chkmin(T &x,T y){ x=min(x,y);}
template<typename T> void read(T &FF){
    FF=0;int RR=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar()) if(ch=='-') RR=-1;
    for(;isdigit(ch);ch=getchar()) FF=(FF<<1)+(FF<<3)+ch-48;
    FF*=RR;
}
const int N=1000010;
int n,k,ans[N];
int main(){
    ios::sync_with_stdio(false);cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>k;
    if(!k){ cout<<-1;exit(0);}
    vector<int> lun;lun.pb(1);k--;
    F(i,n-k+1,n) lun.pb(i);
    F(i,0,SZ(lun)-1) ans[lun[i+1]]=lun[i];
    ans[lun[0]]=lun.back();
    F(i,1,n) if(!ans[i]) ans[i]=i;
    F(i,1,n-1) cout<<ans[i]<<' ';
    cout<<ans[n];
    return 0;
}