#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define ld long double
#define M(x) {x%=mod;if(x<0) x+=mod;}
#define error           \
    {                   \
        cout << "No\n"; \
        return;         \
    }
#define all(x) (x.begin(), x.end())
template <typename A, typename B>
bool smax(A &a, const B &b) { return a < b ? a = b, 1 : 0; }
template <typename A, typename B>
bool smin(A &a, const B &b) { return b < a ? a = b, 1 : 0; }

const int N = 1e6 + 10;
int a[N];
int n, m,k;
const int inf=1e18;

ld eps = 1e-9;
bool eql(ld x, ld y) { return fabs(x - y) < eps; }
bool lt(ld x, ld y) { return !eql(x, y) && x < y; }
bool rt(ld x, ld y) { return !eql(x,y)&& x>y;}
void solve()
{
    cin>>n>>k;
    if(k==0){

        cout<<-1<<"\n";
    } else {

        for(int i=1;i<=n;i++) a[i]=i;
        if(k%2==0){

            for(int i=1;i<=k;i+=2){

                swap(a[i],a[i+1]);
            }
        } else {

            for(int i=2;i<=k;i+=2){

                swap(a[i],a[i+1]);
            }
        }
        for(int i=1;i<=n;i++){

            cout<<a[i]<<" \n"[i==n];
        }
    }

}
signed main()
{
    // freopen("D://Desktop//VSCODE//input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    t=1;
    // cin >> t;
    while (t--)
    {

        solve();
    }
}